Share This Author
Temporal and Modal Logic
- E. Emerson
- PhilosophyHandbook of Theoretical Computer Science, Volume…
- 2 January 1991
Automatic verification of finite-state concurrent systems using temporal logic specifications
It is argued that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems.
Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic
We Propose a method of constructing concurrent programs in which the synchronization skeletonof the program is automatically synthesized from a high-level (branching time) Temporal Logic…
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
We have shown that it is possible to automatically synthesize the synchronization skeleton of a concurrent program from a Temporal Logic specification. We believe that this approach may in the long…
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
A language, CTL*, in which a universal or existential path quantifier can prefix an arbitrary linear time assertion, is defined and the expressive power of a number of sublanguages is compared.
Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons
Tree automata, mu-calculus and determinacy
- E. Emerson, C. Jutla
- Mathematics, Computer Science Proceedings 32nd Annual Symposium of…
- 1 September 1991
It is shown that the propositional mu-calculus is equivalent in expressive power to finite automata on infinite trees, which provides a radically simplified, alternative proof of M.O. Rabin's (1989) complementation lemma for tree automata, which is the heart of one of the deepest decidability results.
Decision procedures and expressiveness in the temporal logic of branching time
It is established that CTL has the small property by showing that any satisfiable CTL formulae is satisfiable in a small finite model obtained from a small -&-ldquo;pseudo-model-&-rdquo%; resulting from the Fischer Ladner quotient construction.
Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract)
The complexity of tree automata and logics of programs
It is shown that for tree automata with m states and n pairs nonemptiness can be tested in time O((mn)/sup 3n/), even though the problem is in general NP-complete, and it follows that satisfiability for propositional dynamic logic with a repetition construct and for the propositional mu-calculus can be tests in deterministic single exponential time.