The complementation problem for Büchi automata with applications to temporal logic
Authors:
- A. Prasad SistlaASA. Prasad Sistla
- Moshe Y. VardiMVMoshe Y. Vardi
- Pierre WolperPWPierre Wolper
- 1 January 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 49 (2-3) , 217-237
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Automata-theoretic techniques for modal logics of programsJournal of Computer and System Sciences, 1986
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Equivalence of infinite behavior of finite automataTheoretical Computer Science, 1984
- Temporal logic can be more expressiveInformation and Control, 1983
- Process logic: Expressiveness, decidability, completenessJournal of Computer and System Sciences, 1982
- The temporal semantics of concurrent programsTheoretical Computer Science, 1981
- Descriptively complete process logicActa Informatica, 1980
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974
- Weakly Definable Relations and Special Automata1970
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966