Local Model Checking in a Logic for True Concurrency

We provide a model-checking technique for a logic for true concurrency, whose formulae predicate about events in computations and their causal dependencies. The logic, that represents the logical counterpart of history-preserving bisimilarity, is naturally interpreted over event structures. It includes minimal and maximal fixpoint operators and thus it can express properties of infinite computations. Global algorithms are not convenient in this setting, since the event structure associated with a system is typically infinite even if the system is finite state, a fact that makes also the decidability of model-checking non-trivial. Focusing on the alternation free fragment of the logic, along the lines of some classical work for the modal mu-calculus, we propose a local model-checking algorithm. The algorithm is given in the form of a tableau system, for which, over a class of event structures satisfying a suitable regularity condition, we prove termination, soundness and completeness.

[1]  Yde Venema,et al.  Weak MSO: automata and expressiveness modulo bisimilarity , 2014, CSL-LICS.

[2]  Gaëlle Fontaine.  Continuous Fragment of the mu-Calculus , 2008, CSL.

[3]  Wojciech Penczek,et al.  Model-checking of causality properties , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[4]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[5]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[6]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

[7]  Julian Gutierrez,et al.  Model-Checking Games for Fixpoint Logics with Partial Order Models , 2009, CONCUR.

[8]  Igor Walukiewicz,et al.  On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic , 1996, CONCUR.

[9]  Matthew Hennessy,et al.  The Power of the Future Perfect in Program Logics , 1984, Inf. Control..

[10]  Rocco De Nicola,et al.  Observational Logics and Concurrency Models , 1990, FSTTCS.

[11]  Rocco De Nicola,et al.  Partial orderings descriptions and observations of nondeterministic concurrent processes , 1988, REX Workshop.

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

[13]  Julian Gutierrez,et al.  On bisimulation and model-checking for concurrent systems with partial order semantics , 2011 .

[14]  E. Allen Emerson,et al.  An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus , 1989, Inf. Comput..

[15]  Raymond R. Devillers,et al.  Fully Concurrent Bisimulation: (LIT 202) , 1989 .

[16]  Sibylle B. Fröschle,et al.  Independence-Friendly Modal Logic and True Concurrency , 2002, Nord. J. Comput..

[17]  Jirí Srba,et al.  Undecidability of domino games and hhp-bisimilarity , 2003, Inf. Comput..

[18]  Irek Ulidowski,et al.  Event Identifier Logic† , 2013, Mathematical Structures in Computer Science.

[19]  P. Madhusudan,et al.  Model-checking trace event structures , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[20]  Ursula Goltz,et al.  Refinement of actions and equivalence notions for concurrent systems , 2001, Acta Informatica.

[21]  Colin Stirling,et al.  Modal Mu-Calculi , 2001 .

[22]  Walter Vogler.  Deciding History Preserving Bisimilarity , 1991, ICALP.

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

[24]  Raymond R. Devillers,et al.  Concurrent bisimulations in Petri nets , 2005, Acta Informatica.

[25]  Silvia Crafa,et al.  A Logic for True Concurrency , 2010, JACM.

[26]  Mogens Nielsen,et al.  Games and Logics for a Noninterleaving Bisimulation , 1995, Nord. J. Comput..

[27]  P. S. Thiagarajan.  Regular Event Structures and Finite Petri Nets: A Conjecture , 2002, Formal and Natural Computing.

[28]  Marco Pistore,et al.  History-Dependent Automata: An Introduction , 2005, SFM.

[29]  F. Laroussiniez,et al.  Logical Characterizations of Truly Concurrent Bisimulation , 1994 .

[30]  Javier Esparza,et al.  Unfoldings - A Partial-Order Approach to Model Checking , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[31]  A. Prasad Sistla,et al.  On model checking for the µ-calculus and its fragments , 2001, Theor. Comput. Sci..

[32]  Julian Gutierrez,et al.  Logics and Bisimulation Games for Concurrency, Causality and Conflict , 2009, FoSSaCS.

[33]  David Walker,et al.  Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..