Hereditary History-Preserving Bisimilarity: Logics and Automata

We study hereditary history-preserving (hhp-) bisimilarity, a canonical behavioural equivalence in the true concurrent spectrum, by means of logics and automata. We first show that hhp-bisimilarity on prime event structures can be characterised in terms of a simple logic whose formulae just observe events in computations and check their executability. The logic suggests a characterisation of hhp-bisimilarity based on history-dependent automata, a formalism for modelling systems with dynamic allocation and deallocation of resources, where the history of resources is traced over time. Prime event structures can be naturally mapped into history-dependent automata in a way that hhp-bisimilarity exactly corresponds to the canonical behavioural equivalence for history-dependent automata.

[1]  Daniele Varacca,et al.  A Compositional Semantics for the Reversible p-Calculus , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[2]  Marco Bernardo,et al.  Formal Methods for Mobile Computing, 5th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM-Moby 2005, Bertinoro, Italy, April 26-30, 2005, Advanced Lectures , 2005, SFM.

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

[4]  Leszek Pacholski,et al.  Mathematical Foundations of Computer Science 1999 , 1999, Lecture Notes in Computer Science.

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

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

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

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

[9]  Hartmut Ehrig,et al.  Formal and Natural Computing , 2002, Lecture Notes in Computer Science.

[10]  Irek Ulidowski,et al.  A hierarchy of reverse bisimulations on stable configuration structures , 2012, Mathematical Structures in Computer Science.

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

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

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

[14]  Iain C. C. Phillips,et al.  Reversing algebraic process calculi , 2006, J. Log. Algebraic Methods Program..

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

[16]  Marco Pistore,et al.  Minimal Transition Systems for History-Preserving Bisimulation , 1997, STACS.

[17]  Marco Pistore,et al.  An Introduction to History Dependent Automata , 1998, HOOTS.

[18]  Slawomir Lasota,et al.  Automata with Group Actions , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[19]  Sibylle B. Fröschle,et al.  On Plain and Hereditary History-Preserving Bisimulation , 1999, MFCS.

[20]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[22]  Cristian Prisacariu,et al.  The Glory of the Past and Geometrical Concurrency. , 2012, 1206.3136.

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

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

[25]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

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