12 search results - page 3 / 3 » The Complexity of Satisfiability for Fragments of CTL and CT... |
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
LICS
1994
IEEE
13 years 9 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...