Model-checking trace event structures

Given regular collection of Mazurkiewicz traces, which can be seen as the behaviors of a finite-state concurrent system, one can associate with it a canonical regular event structure. This event structure is a single (often infinite) structure that captures both the concurrency and conflict information present in the system. We study the problem of model-checking such structures against logics such as first-order logic (FOL), monadic second-order logic (MSOL) and a new logic that lies in between these two called monadic trace logic (MTL). MTL is a fragment of MSOL where the quantification is restricted to sets that are conflict-free. While it is known that model-checking such event structures against MSOL is undecidable, our main results are that FOL and MTL admit effective model-checking procedures. It turns out that FOL captures previously known decidable temporal logics on event structures. MTL is more powerful and can express interesting branching-time properties of event structures, and when restricted to a sequential setting, can express the standard logic CTL over trees.

[1]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[2]  Anca Muscholl,et al.  Logical Definability on Infinite Traces , 1996, Theor. Comput. Sci..

[3]  Jacques Sakarovitch,et al.  Synchronized Rational Relations of Finite and Infinite Words , 1993, Theor. Comput. Sci..

[4]  Glynn Winskel,et al.  Categories of Models for Concurrency , 1984, Seminar on Concurrency.

[5]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[6]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[7]  Glynn Winskel,et al.  Models for Concurrency , 1994 .

[8]  Wojciech Penczek Branching time and partial order in temporal logics , 1995 .

[9]  Madhavan Mukund,et al.  A Logical Characterization of Well Branching Event Structures , 1992, Theor. Comput. Sci..

[10]  P. S. Thiagarajan,et al.  Regular Trace Event Structures , 1996 .

[11]  Markus Lohrey,et al.  On the Theory of One-Step Rewriting in Trace Monoids , 2002, ICALP.

[12]  P. S. Thiagarajan,et al.  Temporal Logics for Communicating Sequential Agents: I , 1992, Int. J. Found. Comput. Sci..

[13]  Nils Klarlund,et al.  MONA 1.x: New Techniques for WS1S and WS2S , 1998, CAV.

[14]  Wolfgang Thomas,et al.  A Short Introduction to Infinite Automata , 2001, Developments in Language Theory.

[15]  P. S. Thiagarajan,et al.  Regular Event Structures and Finite Petri Nets: The Conflict-Free Case , 2002, ICATPN.

[16]  Wojciech Penczek,et al.  Model-Checking for a Subclass of Event Structures , 1997, TACAS.

[17]  Peter Niebert,et al.  Verification Based on Local States , 1998, TACAS.

[18]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[19]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.

[20]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[21]  Wolfgang Thomas,et al.  Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree , 1987, ICALP.