Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Models for concurrency: towards a classification
Theoretical Computer Science
The difference between splitting in n and n + 1
Information and Computation
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Weak Bisimulation and Open Maps
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Reversing algebraic process calculi
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Concurrency, Graphs and Models
Reversible enhanced event structures: Towards reversible E-LOTOS
Computer Standards & Interfaces
Proceedings of the 9th International Conference on Computational Methods in Systems Biology
Event structure semantics of parallel extrusion in the pi-calculus
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Modelling of bonding with processes and events
RC'13 Proceedings of the 5th international conference on Reversible Computation
A Compositional Semantics for the Reversible p-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [Danos, V. and J. Krivine, Reversible communicating systems, in: P. Gardner and N. Yoshida, editors, Proceedings of the 15th International Conference on Concurrency Theory CONCUR 2004, LNCS 3170 (2004), pp. 292-307] and CCSK [Phillips, I.C.C. and I. Ulidowski, Reversing algebraic process calculi, in: Proceedings of 9th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2006, LNCS 3921 (2006), pp. 246-260. Extended version accepted by Journal of Logic and Algebraic Programming] were developed and general techniques for reversing other process operators were proposed. The paper shows that the notion of reversibility can bridge the gap between some interleaving models and non-interleaving models of concurrency, and makes them interchangeable. We prove that transition systems associated with reversible process algebras are equivalent as models to labelled prime event structures. Furthermore, we show that forward-reverse bisimulation corresponds to hereditary history-preserving bisimulation in the setting with no auto-concurrency and no auto-causation.