Handbook of theoretical computer science (vol. B)
Event structures and trace monoids
Theoretical Computer Science
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)
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
Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Distributed Asynchronous Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Unfolding synthesis of asynchronous automata
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Concurrent automata vs. asynchronous systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We formulate the notion of a regular event structures and conjecture that they correspond exactly to finite 1-safe Petri nets. We offer a partial result in support of the conjecture. This result is in terms of a natural subclass of regular event structures that admit a sensible labeling with Mazurkiewicz trace alphabets.