An automata theoretic decision procedure for the propositional mu-calculus
- 1 June 1989
- journal article
- Published by Elsevier in Information and Computation
- Vol. 81 (3) , 249-264
- https://doi.org/10.1016/0890-5401(89)90031-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Propositional dynamic logic of looping and converse is elementarily decidableInformation and Control, 1982
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- Finiteness is mu-ineffableTheoretical Computer Science, 1976
- On the termination of program schemasInformation and Control, 1975
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966