Regular event structures and finite Petri nets: a conjecture

Authors:
P. S. Thiagarajan
Affiliations:
School of Computing, National University of Singapore, 3 Science Drive 2, Singapore
Venue:
Formal and natural computing
Year:
2002

Citing 9
Cited 3

Automata on infinite objects

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)
Models for concurrency

Handbook of logic in computer science (vol. 4)
The Book of Traces

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

Regular Event Structures and Finite Petri Nets: The Conflict-Free Case

ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Compositional synthesis of asynchronous automata

Theoretical Computer Science
What topology tells us about diagnosability in partial order semantics

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.