| Publication | Date of Publication | Type |
|---|
| An efficient state space construction for a class of timed automata | 2024-06-05 | Paper |
Petri Net Primer
Computer Science Foundations and Applied Logic | 2024-03-11 | Paper |
Articulation of Transition Systems and Its Application to Petri Net Synthesis
Application and Theory of Petri Nets and Concurrency | 2024-01-29 | Paper |
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
Fundamenta Informaticae | 2023-11-23 | Paper |
| On the reversibility of circular conservative Petri nets | 2023-11-16 | Paper |
Petri boxes and finite precedence
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues
Fundamenta Informaticae | 2022-10-31 | Paper |
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
Fundamenta Informaticae | 2022-10-31 | Paper |
A new property of choice-free Petri net systems
Application and Theory of Petri Nets and Concurrency | 2022-09-01 | Paper |
| Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues | 2022-08-19 | Paper |
| Synthesis of (choice-free) reset nets | 2022-03-21 | Paper |
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
Fundamenta Informaticae | 2022-02-01 | Paper |
Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
(available as arXiv preprint) | 2021-06-14 | Paper |
Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
(available as arXiv preprint) | 2021-06-14 | Paper |
Target-oriented Petri net synthesis
Fundamenta Informaticae | 2021-05-20 | Paper |
Dynamic exploration of multi-agent systems with periodic timed tasks
Fundamenta Informaticae | 2021-05-20 | Paper |
Analysis and synthesis of weighted marked graph Petri nets: exact and approximate methods
Fundamenta Informaticae | 2020-01-24 | Paper |
| Analysis and synthesis of weighted marked graph Petri nets | 2019-12-18 | Paper |
| Factorisation of Petri net solvable transition systems | 2019-12-18 | Paper |
Simultaneous Petri Net Synthesis
Scientific Annals of Computer Science | 2019-02-08 | Paper |
Bounded choice-free Petri net synthesis: algorithmic issues
Acta Informatica | 2018-10-09 | Paper |
On deadlockability, liveness and reversibility in subclasses of weighted Petri nets
Fundamenta Informaticae | 2018-10-02 | Paper |
| On liveness and deadlockability in subclasses of weighted Petri nets | 2018-08-20 | Paper |
Factorisation of transition systems
Acta Informatica | 2018-06-26 | Paper |
Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata
Lecture Notes in Computer Science | 2018-02-16 | Paper |
| Synthesis of bounded choice-free Petri nets | 2017-09-12 | Paper |
A graph-theoretical characterisation of state separation
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 |
The power of prime cycles
Application and Theory of Petri Nets and Concurrency | 2016-10-04 | Paper |
Minimal elements for the prime numbers
Experimental Mathematics | 2016-06-29 | Paper |
Liu and Layland's schedulability test revisited
Information Processing Letters | 2016-06-16 | Paper |
Synthesis of live and bounded persistent systems
Fundamenta Informaticae | 2016-05-02 | Paper |
State space axioms for T-systems
Acta Informatica | 2015-04-16 | Paper |
Efficient reachability graph representation of Petri nets with unbounded counters
Electronic Notes in Theoretical Computer Science | 2015-03-19 | 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 |
| A Petri net semantics of a simple process algebra for mobility | 2013-10-07 | Paper |
A Petri net interpretation of open reconfigurable systems
Fundamenta Informaticae | 2013-04-18 | Paper |
A Petri net interpretation of open reconfigurable systems
Applications and Theory of Petri Nets | 2011-06-29 | Paper |
An algebra of non-safe Petri boxes
Algebraic Methodology and Software Technology | 2011-05-06 | Paper |
Boundedness undecidability for synchronized nets
Information Processing Letters | 2010-01-29 | Paper |
A Petri Net Translation of π-Calculus Terms
Lecture Notes in Computer Science | 2008-09-11 | Paper |
A compositional Petri net translation of general \(\pi\)-calculus terms
Formal Aspects of Computing | 2008-08-21 | Paper |
Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets
Applications and Theory of Petri Nets | 2008-07-03 | Paper |
| Petri net semantics of the finite \(\pi\)-calculus terms | 2006-07-26 | Paper |
| Synchronous and asynchronous communications in composable parametrized high-level Petri nets | 2006-06-19 | Paper |
Formal Techniques for Networked and Distributed Systems – FORTE 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 2064221 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 2013193 (Why is no real title available?) | 2003-12-04 | Paper |
General parameterised refinement and recursion for the M-net calculus
Theoretical Computer Science | 2003-07-30 | Paper |
The box algebra = Petri nets + process expressions
Information and Computation | 2003-01-14 | Paper |
| A unified model for nets and process algebras | 2001-12-18 | Paper |
Recursion and Petri nets
Acta Informatica | 2001-12-13 | Paper |
| scientific article; zbMATH DE number 1501606 (Why is no real title available?) | 2000-09-04 | Paper |
Petri net algebra
Monographs in Theoretical Computer Science. An EATCS Series | 2000-08-07 | Paper |
| scientific article; zbMATH DE number 1435984 (Why is no real title available?) | 2000-06-21 | Paper |
S-invariant analysis of general recursive Petri boxes
Acta Informatica | 1995-07-24 | Paper |
| scientific article; zbMATH DE number 512822 (Why is no real title available?) | 1994-04-07 | Paper |
Equality of agent expressions is preserved under an extension of the universe of actions
Formal Aspects of Computing | 1993-06-29 | Paper |
Maximality preserving bisimulation
Theoretical Computer Science | 1992-09-27 | Paper |
Concurrent bisimulations in Petri nets
Acta Informatica | 1991-01-01 | Paper |
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science | 1987-01-01 | Paper |
Concurrent and maximally concurrent evolution of nonsequential systems
Theoretical Computer Science | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3905854 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3902013 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3679171 (Why is no real title available?) | 1980-01-01 | Paper |
Hashing techniques, a global approach
BIT | 1979-01-01 | Paper |
Game interpretation of the deadlock avoidance problem
Communications of the ACM | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3573230 (Why is no real title available?) | 1977-01-01 | Paper |
Improvement of parallelism in a finite buffer sharing policy
The Computer Journal | 1976-01-01 | Paper |
Realization of Petri nets without conditional statements
Information Processing Letters | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3431735 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3283838 (Why is no real title available?) | 1968-01-01 | Paper |
