Handbook of theoretical computer science (vol. B)
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Transition systems, event structures, and unfoldings
Information and Computation
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Handbook of logic in computer science (vol. 4)
Branching time controllers for discrete event systems
Theoretical Computer Science
The Book of Traces
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Hereditary History Preserving Bisimilarity Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Product Version of Dynamic Linear Time Temporal Logic
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Regular event structures and finite Petri nets: a conjecture
Formal and natural computing
UML for real
A regular viewpoint on processes and algebra
Acta Cybernetica
Concurrent automata vs. asynchronous systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.01 |
We present the notion of regular event structures and conjecture that they correspond exactly to finite 1-safe Petri nets. We show that the conjecture holds for the conflict-free case. Even in this restricted setting, the proof is non-trivial and involves a natural subclass of regular event structures that admit a sensible labeling with Mazurkiewicz trace alphabets.