| Publication | Date of Publication | Type |
|---|
Reversing Unbounded Petri Nets
Application and Theory of Petri Nets and Concurrency | 2024-01-29 | Paper |
Reversing Steps in Petri Nets
Application and Theory of Petri Nets and Concurrency | 2024-01-29 | Paper |
Interval traces with mutex relation
| 2023-11-16 | Paper |
Reaction Systems, Transition Systems, and Equivalences
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Verification of multi-agent properties in electronic voting: a case study
| 2023-03-24 | Paper |
Formal translation from reversing Petri nets to coloured Petri nets
| 2022-11-11 | Paper |
Paradigms of concurrency. Observations, behaviours and systems -- a Petri net view
Studies in Computational Intelligence | 2022-02-21 | Paper |
Investigating reversibility of steps in Petri nets
Fundamenta Informaticae | 2022-02-01 | Paper |
Algebraic structure of step traces and interval traces
Fundamenta Informaticae | 2021-05-20 | Paper |
Relational structures for concurrent behaviours
Theoretical Computer Science | 2021-03-09 | Paper |
Reaction Systems and Enabling Equivalence
Fundamenta Informaticae | 2020-06-21 | Paper |
Generating all minimal Petri net unsolvable binary words
Discrete Applied Mathematics | 2020-02-14 | Paper |
An extension of the taxonomy of persistent and nonviolent steps
Information Sciences | 2020-02-07 | Paper |
Approximate verification of strategic abilities under imperfect information
Artificial Intelligence | 2020-01-20 | Paper |
An efficient characterization of Petri net solvable binary words
| 2019-12-18 | Paper |
Classifying invariant structures of step traces
Journal of Computer and System Sciences | 2019-06-25 | Paper |
A precise characterisation of step traces and their concurrent histories
Scientific Annals of Computer Science | 2019-02-08 | Paper |
Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version)
Scientific Annals of Computer Science | 2019-02-08 | Paper |
Reversing transitions in bounded Petri nets
Fundamenta Informaticae | 2018-05-03 | Paper |
Invariant structures and dependence relations
Fundamenta Informaticae | 2018-01-19 | Paper |
Alphabets of Acyclic Invariant Structures
Fundamenta Informaticae | 2018-01-19 | Paper |
Conditions for Petri net solvable binary words
Transactions on Petri Nets and Other Models of Concurrency XI | 2017-06-20 | Paper |
Reversible computation vs. reversibility in Petri nets
Reversible Computation | 2016-08-10 | Paper |
Persistent and nonviolent steps and the design of GALS systems
Fundamenta Informaticae | 2016-05-11 | Paper |
Characterising concurrent histories
Fundamenta Informaticae | 2016-04-28 | Paper |
Square-free words over partially commutative alphabets
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Order structures for subclasses of generalised traces
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Step traces
Acta Informatica | 2016-02-19 | Paper |
Visualisation of concurrent processes
| 2015-08-10 | Paper |
Folded Hasse diagrams of combined traces
Information Processing Letters | 2014-04-15 | Paper |
Transposition rearrangement: linear algorithm for length-cost model
Annales UMCS, Informatica | 2014-04-02 | Paper |
Algebraic structure of combined traces
Logical Methods in Computer Science | 2013-09-06 | Paper |
A taxonomy of persistent and nonviolent steps
Application and Theory of Petri Nets and Concurrency | 2013-06-28 | Paper |
On persistent reachability in Petri nets
Information and Computation | 2013-06-06 | Paper |
Algebraic structure of combined traces
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Internal Conflict-Free Projection Sets
Man-Machine Interactions | 2010-03-05 | Paper |
Projection representation of Mazurkiewicz traces
| 2009-01-28 | Paper |
Cross-section optimization under multiple loads
ZAMM. Zeitschrift für Angewandte Mathematik und Mechanik | 2002-02-27 | Paper |
