Model-checking games for fixpoint logics with partial order models

In this paper, we introduce model-checking games that allow local second-order power on sets of independent transitions in the underlying partial order models where the games are played. Since the interleaving semantics of such models is not considered, some problems that may arise when using interleaving representations are avoided and new decidability results for partial order models of concurrency are achieved. The games are shown to be sound and complete, and therefore determined. While in the interleaving case they coincide with the local model-checking games for the @m-calculus, in a partial order setting they verify properties of a number of fixpoint modal logics that can specify, in concurrent systems with partial order semantics, several properties not expressible with the @m-calculus. The games underpin a novel decision procedure for model-checking all temporal properties of a class of infinite and regular event structures, thus improving, in terms of temporal expressive power, previous results in the literature.

[1]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[2]  Paul-André Melliès.  Asynchronous games 2: The true concurrency of innocence , 2006, Theor. Comput. Sci..

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

[4]  Antoni W. Mazurkiewicz,et al.  Introduction to Trace Theory , 1995, The Book of Traces.

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

[6]  John C. Reynolds,et al.  Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[7]  Colin Stirling,et al.  Modal and Temporal Properties of Processes , 2001, Texts in Computer Science.

[8]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[9]  Julian C. Bradfield.  The Modal µ-Calculus Alternation Hierarchy is Strict , 1998, Theor. Comput. Sci..

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

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

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

[13]  Samson Abramsky,et al.  Concurrent games and full completeness , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[14]  Erich Grädel.  Model Checking Games , 2002, Electron. Notes Theor. Comput. Sci..

[15]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[16]  Martin Lange,et al.  Model Checking Games for Branching Time Logics , 2002, J. Log. Comput..

[17]  Martin Lange,et al.  Games for modal and temporal logics , 2003 .

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

[19]  Manfred Droste.  Concurrent Automata and Domains , 1992, Int. J. Found. Comput. Sci..

[20]  Wojciech Penczek,et al.  Traces and Logic , 1995, The Book of Traces.

[21]  Perdita Stevens,et al.  Practical Model-Checking Using Games , 1998, TACAS.

[22]  Rocco De Nicola,et al.  A distributed operational semantics for CCS based on condition/event systems , 1988, Acta Informatica.

[23]  Pierre Wolper,et al.  A partial approach to model checking , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

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

[25]  Viggo Stoltenberg-hansen,et al.  In: Handbook of Logic in Computer Science , 1995 .

[26]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[27]  Vladimiro Sassone,et al.  Comparing Transition Systems with Independence and Asynchronous Transition Systems , 1996, CONCUR.

[28]  I. Walukiewicz.  A landscape with games in the background , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[29]  Mads Dam.  CTL* and ECTL* as Fragments of the Modal mu-Calculus , 1994, Theor. Comput. Sci..

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

[31]  Stephan Merz,et al.  Model Checking , 2000 .

[32]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[33]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

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

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

[36]  Colin Stirling,et al.  Modal mu-calculi , 2007, Handbook of Modal Logic.

[37]  Colin Stirling,et al.  Handbook of Modal Logic , 2007 .

[38]  Colin Stirling,et al.  Local model checking games (extended abstract) , 1995 .

[39]  Johan van Benthem,et al.  Logic Games: From Tools to Models of Interaction , 2011, Proof, Computation and Agency.

[40]  Glynn Winskel,et al.  Event Structure Semantics for CCS and Related Languages , 1982, ICALP.

[41]  Glynn Winskel,et al.  Models for Concurrency: Towards a Classification , 1996, Theor. Comput. Sci..

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

[43]  Faron Moller,et al.  On the expressive power of CTL , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[44]  Wojciech Penczek,et al.  A partial order approach to branching time logic model checking , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

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

[46]  Volker Diekert,et al.  The Book of Traces , 1995 .