Model-Checking Games for Fixpoint Logics with Partial Order Models
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Model-checking games for fixpoint logics with partial order models
Information and Computation
The MSO theory of connectedly communicating processes
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
Given a regular collection of Mazurkiewicz traces, whichcan be seen as the behaviours of a finite-state concurrentsystem, one can associate with it a canonical regular eventstructure. This event structure is a single (often infinite)structure that captures both the concurrency and conflictinformation present in the system. We study the problem ofmodel-checking such structures against logics such as first-orderlogic (FOL), monadic second-order logic (MSOL) anda new logic that lies in between these two called monadictrace logic (MTL). MTL is a fragment of MSOL wherethe quantification is restricted to sets that are conflict-free.While it is known that model-checking such event structuresagainst MSOL is undecidable, our main results are thatFOL and MTL admit effective model-checking procedures.It turns out that FOL captures previously known decidabletemporal logics on event structures. MTL is more powerfuland can express interesting branching-time properties ofevent structures, and when restricted to a sequential setting,can express the standard logic CTL* over trees.