231 search results - page 1 / 47 » Mu-calculus path checking |
CAV
2003
Springer
13 years 10 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
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 ...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
ICALP
1997
Springer
13 years 8 months ago
1997
Springer
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...