| Publication | Date of Publication | Type |
|---|
Petri Net Primer
Computer Science Foundations and Applied Logic | 2024-03-11 | Paper |
Linear constraint systems as high-level nets
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
Compositional process semantics of Petri Boxes
Lecture Notes in Computer Science | 2023-04-28 | Paper |
Refinement of coloured petri nets
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Orthogonal transformations for coloured Petri nets
| 2022-12-09 | Paper |
A new property of choice-free Petri net systems
Application and Theory of Petri Nets and Concurrency | 2022-09-01 | Paper |
A refined view of the box algebra
Lecture Notes in Computer Science | 2022-08-16 | Paper |
A class of composable high level Petri nets
Lecture Notes in Computer Science | 2022-08-16 | Paper |
Properties of Plain, Pure, and Safe Petri Nets
Lecture Notes in Computer Science | 2021-06-14 | Paper |
Target-oriented Petri net synthesis
Fundamenta Informaticae | 2021-05-20 | Paper |
Analysis of Petri nets and transition systems
| 2020-02-14 | Paper |
From event-oriented models to transition systems
| 2019-12-18 | Paper |
Simultaneous Petri Net Synthesis
Scientific Annals of Computer Science | 2019-02-08 | Paper |
Solving recursive net equations
Automata, Languages and Programming | 2019-01-10 | Paper |
Sufficient conditions for the marked graph realisability of labelled transition systems
Theoretical Computer Science | 2018-11-23 | Paper |
Bounded choice-free Petri net synthesis: algorithmic issues
Acta Informatica | 2018-10-09 | Paper |
Plain, bounded, reversible, persistent, and \(k\)-marked Petri nets have marked graph reachability graphs
| 2018-03-26 | Paper |
True concurrent equivalences in time Petri nets
Fundamenta Informaticae | 2017-11-09 | Paper |
Synthesis of bounded choice-free Petri nets
| 2017-09-12 | Paper |
Conditions for Petri net solvable binary words
Transactions on Petri Nets and Other Models of Concurrency XI | 2017-06-20 | Paper |
A graph-theoretical characterisation of state separation
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Configuration- and residual-based transition systems for event structures with asymmetric conflict
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Characterisation of the state spaces of marked graph Petri nets
Information and Computation | 2017-03-16 | Paper |
Characterising Petri net solvable binary words
Application and Theory of Petri Nets and Concurrency | 2016-10-04 | Paper |
The power of prime cycles
Application and Theory of Petri Nets and Concurrency | 2016-10-04 | Paper |
Relational semantics revisited
Electronic Notes in Theoretical Computer Science | 2016-06-03 | Paper |
Synthesis of live and bounded persistent systems
Fundamenta Informaticae | 2016-05-02 | Paper |
Existence of home states in Petri nets is decidable
Information Processing Letters | 2016-04-06 | Paper |
Petri net distributability
Perspectives of Systems Informatics | 2015-12-07 | Paper |
State space axioms for T-systems
Acta Informatica | 2015-04-16 | Paper |
Synthesis and reengineering of persistent systems
Acta Informatica | 2015-03-02 | Paper |
Synthesis of Persistent Systems
Application and Theory of Petri Nets and Concurrency | 2014-07-08 | Paper |
Characterisation of the state spaces of live and bounded marked graph Petri nets
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Structure theory of Petri nets
Transactions on Petri Nets and Other Models of Concurrency VII | 2013-05-31 | Paper |
Unifying Equivalences for Higher Dimensional Automata
Fundamenta Informaticae | 2012-10-29 | Paper |
Deciding Selective Declassification of Petri Nets
Lecture Notes in Computer Science | 2012-06-29 | Paper |
Separability in persistent Petri nets
| 2012-03-22 | Paper |
A categorical view of timed behaviours
Fundamenta Informaticae | 2011-06-14 | Paper |
Separability in Persistent Petri Nets
Applications and Theory of Petri Nets | 2010-06-22 | Paper |
Separability in Conflict-Free Petri Nets
Perspectives of Systems Informatics | 2010-02-02 | Paper |
scientific article; zbMATH DE number 5587264 (Why is no real title available?)
| 2009-07-27 | Paper |
A decomposition theorem for finite persistent transition systems
Acta Informatica | 2009-05-08 | Paper |
Decomposition Theorems for Bounded Persistent Petri Nets
Applications and Theory of Petri Nets | 2008-07-03 | Paper |
A Note on Persistent Petri Nets
Concurrency, Graphs and Models | 2008-06-19 | Paper |
scientific article; zbMATH DE number 5286860 (Why is no real title available?)
| 2008-06-11 | Paper |
Making Petri nets safe and free of internal transitions
| 2008-01-02 | Paper |
Lectures on Concurrency and Petri Nets
Lecture Notes in Computer Science | 2005-12-23 | Paper |
scientific article; zbMATH DE number 2013193 (Why is no real title available?)
| 2003-12-04 | Paper |
The box algebra = Petri nets + process expressions
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1696450 (Why is no real title available?)
| 2002-06-17 | Paper |
A unified model for nets and process algebras
| 2001-12-18 | Paper |
Recursion and Petri nets
Acta Informatica | 2001-12-13 | Paper |
Petri net algebra
Monographs in Theoretical Computer Science. An EATCS Series | 2000-08-07 | Paper |
M-nets: An algebra of high-level Petri-nets, with an application to the semantics of concurrent programming languages
Acta Informatica | 1999-06-13 | Paper |
Operational and denotational semantics for the box algebra
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1231479 (Why is no real title available?)
| 1998-12-13 | Paper |
scientific article; zbMATH DE number 1059334 (Why is no real title available?)
| 1998-02-02 | Paper |
scientific article; zbMATH DE number 977449 (Why is no real title available?)
| 1997-02-12 | Paper |
scientific article; zbMATH DE number 723228 (Why is no real title available?)
| 1995-02-15 | Paper |
scientific article; zbMATH DE number 512822 (Why is no real title available?)
| 1994-04-07 | Paper |
scientific article; zbMATH DE number 408787 (Why is no real title available?)
| 1993-09-06 | Paper |
scientific article; zbMATH DE number 193318 (Why is no real title available?)
| 1993-06-05 | Paper |
scientific article; zbMATH DE number 176521 (Why is no real title available?)
| 1993-05-18 | Paper |
Compositional generation of home states in free choice nets
Formal Aspects of Computing | 1993-04-01 | Paper |
scientific article; zbMATH DE number 44349 (Why is no real title available?)
| 1993-01-23 | Paper |
Traps characterize home states in free choice systems
Theoretical Computer Science | 1992-09-27 | Paper |
Petri net semantics of priority systems
Theoretical Computer Science | 1992-09-26 | Paper |
Concurrent bisimulations in Petri nets
Acta Informatica | 1991-01-01 | Paper |
Partial order behaviour and structure of Petri nets
Formal Aspects of Computing | 1990-01-01 | Paper |
Semantic independence
Science of Computer Programming | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4085040 (Why is no real title available?)
| 1988-01-01 | Paper |
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4031000 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4033101 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4018373 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4047138 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3905854 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3909720 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3902012 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3974310 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3974309 (Why is no real title available?)
| 1985-01-01 | Paper |
Fairness and conspiracies
Information Processing Letters | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3872691 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3843143 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3808927 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3780568 (Why is no real title available?)
| 1982-01-01 | Paper |
Adequacy properties of path programs
Theoretical Computer Science | 1982-01-01 | Paper |
A formal model of atomicity in asynchronous systems
Acta Informatica | 1981-01-01 | Paper |
Systematic detection of exception occurrences
Science of Computer Programming | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3703981 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3707757 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3700233 (Why is no real title available?)
| 1980-01-01 | Paper |
A note on the proof of a concurrent program
Information Processing Letters | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3601083 (Why is no real title available?)
| 1978-01-01 | Paper |
scientific article; zbMATH DE number 3506178 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3501007 (Why is no real title available?)
| 1975-01-01 | Paper |
