Kamila Barylska
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kamila Barylska has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Łukasz Mikulski
Nicolaus Copernicus University in Torun
7 shared publications - Marcin Piątkowski
Nicolaus Copernicus University
6 shared publications - Eike Best
Carl von Ossietzky Universität Oldenburg
2 shared publications Evgeny Erofeev
2 shared publicationsMaciej Koutny
2 shared publications- Anna Gogolińska
Nicolaus Copernicus University
1 shared publication
Latest Publications
- 1 June 2026
- Published by Springer Nature
- p. 195-230
Analysis and Synthesis of Some Subclasses of Petri Nets
- 1 June 2026
- Published by Springer Nature
- p. 195-230
Analysis and Synthesis of Some Subclasses of Petri Nets
- 28 June 2022
- Published by Springer Nature
- p. 172-186
Formal Translation from Reversing Petri Nets to Coloured Petri Nets
- 28 June 2022
- Published by Springer Nature
- p. 172-186
Formal Translation from Reversing Petri Nets to Coloured Petri Nets
- 1 March 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 274, 35-53
Generating all minimal petri net unsolvable binary words
- 1 March 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 274, 35-53
Generating all minimal petri net unsolvable binary words
- 31 January 2018
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 157 (4) , 341-357
Reversing Transitions in Bounded Petri Nets
Reversible computation deals with mechanisms for undoing the effects of actions executed by a dynamic system. This paper is concerned with reversibility in the context of Petri nets which are a general formal model of concurrent systems. A key constr
- 31 January 2018
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 157 (4) , 341-357
Reversing Transitions in Bounded Petri Nets
Reversible computation deals with mechanisms for undoing the effects of actions executed by a dynamic system. This paper is concerned with reversibility in the context of Petri nets which are a general formal model of concurrent systems. A key constr
- 1 January 2018
- Published by Elsevier in Science of Computer Programming
- Vol. 151, 48-60
Reversible computation vs. reversibility in Petri nets
- 1 January 2018
- Published by Elsevier in Science of Computer Programming
- Vol. 151, 48-60
Reversible computation vs. reversibility in Petri nets
- 2 September 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 137-159
Conditions for Petri Net Solvable Binary Words
- 2 September 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 137-159
Conditions for Petri Net Solvable Binary Words
- Open Access
- 30 June 2016
- Published by Springer Nature
- p. 105-118
Reversible Computation vs. Reversibility in Petri Nets
- 30 June 2016
- Published by Springer Nature
- p. 105-118
Open AccessReversible Computation vs. Reversibility in Petri Nets
- 1 February 2013
- Published by Elsevier in Information and Computation
- Vol. 223, 67-77
On persistent reachability in Petri nets
- 1 February 2013
- Published by Elsevier in Information and Computation
- Vol. 223, 67-77
On persistent reachability in Petri nets
- 1 January 2009
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 93 (1-3) , 33-43
Levels of Persistency in Place/Transition Nets
The notion of persistency, based on the rule "no action can disable another one" is one of the classical notions in concurrency theory. We propose two ways of generalization of this notion: the first is "no action can kill another one" and the second "no action can kill another enabled one". We study the three notions in the context of place/transition nets, the fundamental class of Petri nets. We prove that the three classes of persistency form an increased strict hierarchy. The final section of the paper deals with decision problems about persistency. We show that the set reachability problem is decidable for rational convex sets, and using this result we prove that all kinds of persistency are decidable in the class place/transition nets.
- 1 January 2009
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 93 (1-3) , 33-43
Levels of Persistency in Place/Transition Nets
The notion of persistency, based on the rule "no action can disable another one" is one of the classical notions in concurrency theory. We propose two ways of generalization of this notion: the first is "no action can kill another one" and the second "no action can kill another enabled one". We study the three notions in the context of place/transition nets, the fundamental class of Petri nets. We prove that the three classes of persistency form an increased strict hierarchy. The final section of the paper deals with decision problems about persistency. We show that the set reachability problem is decidable for rational convex sets, and using this result we prove that all kinds of persistency are decidable in the class place/transition nets.