An algorithmic approach for checking closure properties of Ω-regular languages
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 596-610
- https://doi.org/10.1007/3-540-61604-7_78
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Model-checking of causality propertiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Combining partial order reductions with on-the-fly model-checkingFormal Methods in System Design, 1996
- Rational and Recognizable Complex Trace LanguagesInformation and Computation, 1995
- Proving partial order propertiesTheoretical Computer Science, 1994
- Verification of distributed programs using representative interleaving sequencesDistributed Computing, 1992
- Event fairness and non-interleaving concurrencyFormal Aspects of Computing, 1989
- A syntactic congruence for rational ω-languagesTheoretical Computer Science, 1985
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsIEEE Transactions on Computers, 1979
- The temporal logic of programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Lower bounds for natural proof systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977