Reversible computation vs. reversibility in Petri nets
Authors:
- Kamila BarylskaKBKamila Barylska
- Maciej KoutnyMKMaciej Koutny
- Łukasz MikulskiŁMŁukasz Mikulski
- Marcin PiątkowskiMPMarcin Piątkowski
- 1 January 2018
- journal article
- research article
- Published by Elsevier in Science of Computer Programming
- Vol. 151, 48-60
Abstract
No abstract availableKeywords
Funding Information
- European Cooperation in Science and Technology (IC1405)
- National Center for Science and Engineering Statistics (2013/09/D/ST6/03928)
This publication has 14 references indexed in Scilit:
- Reversing algebraic process calculiThe Journal of Logic and Algebraic Programming, 2007
- General ReversibilityElectronic Notes in Theoretical Computer Science, 2007
- Modeling and analysis of sequential processes that cooperate through buffersIEEE Transactions on Robotics and Automation, 1998
- Choice-free Petri nets: a model for deterministic concurrent systems with bulk services and arrivalsIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 1997
- Reachability in cyclic extended free-choice systemsTheoretical Computer Science, 1993
- Traps characterize home states in free choice systemsTheoretical Computer Science, 1992
- The chemical abstract machineTheoretical Computer Science, 1992
- Decidable problems on the strong connectivity of Petri net reachability setsTheoretical Computer Science, 1977
- Parallel program schemataJournal of Computer and System Sciences, 1969
- Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime FactorsAmerican Journal of Mathematics, 1913