3 papers
cs.LO2023
Formal Translation from Reversing Petri Nets to Coloured Petri Nets
Kamila Barylska, Anna Gogolinska, Lukasz Mikulski +3
Reversible computation is an emerging computing paradigm that allows any sequence of operations to be executed in reverse order at any point during computation. Its appeal lies in…
cs.CL2021
Acyclic and Cyclic Reversing Computations in Petri Nets
Kamila Barylska, Anna Gogolińska
Reversible computations constitute an unconventional form of computing where any sequence of performed operations can be undone by executing in reverse order at any point during a…
cs.LO2015
Hierarchy of persistence with respect to the length of action's disability
Kamila Barylska, Edward Ochmański
The notion of persistence, based on the rule "no action can disable another one" is one of the classical notions in concurrency theory. It is also one of the issues discussed in th…