Reversible Computation vs. Reversibility in Petri Nets
From MaRDI portal
Publication:3186587
DOI10.1007/978-3-319-40578-0_7zbMath1476.68164OpenAlexW2341552178WikidataQ104379704 ScholiaQ104379704MaRDI QIDQ3186587
Łukasz Mikulski, Maciej Koutny, Kamila Barylska, Marcin Piątkowski
Publication date: 10 August 2016
Published in: Reversible Computation (Search for Journal in Brave)
Full work available at URL: https://eprint.ncl.ac.uk/fulltext.aspx?url=223279/295CB054-5A67-4E1B-A540-E4F9BE2CBF48.pdf&pub_id=223279
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Towards Bridging Time and Causal Reversibility, Reversible computation in nets with bonds, Towards a taxonomy for reversible computation approaches, An axiomatic approach to reversible computation, Unnamed Item, Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications, Formal translation from reversing Petri nets to coloured Petri nets
Uses Software
Cites Work
- Unnamed Item
- Existence of home states in Petri nets is decidable
- Reachability in cyclic extended free-choice systems
- Reversibility and asymmetric conflict in event structures
- The chemical abstract machine
- Traps characterize home states in free choice systems
- Decidable problems on the strong connectivity of Petri net reachability sets
- Parallel program schemata
- Reversing algebraic process calculi
- General Reversibility
- On the Reversibility of Live Equal-Conflict Petri Nets
- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
- Reversing Higher-Order Pi
- CONCUR 2004 - Concurrency Theory
- CONCUR 2005 – Concurrency Theory
