A unified approach for showing language containment and equivalence between various types of ω-automata
Authors:
- 1 January 1990
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 103-116
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the complexity of omega -automata1988
- Specification and verification of concurrent programs by A ∀ automata1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Automatic verification of asynchronous circuits using temporal logicIEE Proceedings E Computers and Digital Techniques, 1986
- Temporal reasoning under generalized fairness constraints1985
- Temporal logic can be more expressiveInformation and Control, 1983
- Propositional dynamic logic of looping and converse is elementarily decidableInformation and Control, 1982
- Infinite sequences and finite machines1963