63 search results - page 2 / 13 » The Complexity of Model Checking in Modal Event Calculi |
BCS
2008
13 years 6 months ago
2008
Parity games underlie the model checking problem for the modal
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...
CONCUR
2006
Springer
13 years 8 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
ENTCS
2010
13 years 2 months ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...