On the Synthesis of Zero-Safe Nets

Authors:
Philippe Darondeau
Affiliations:
IRISA, campus de Beaulieu, Rennes Cedex, France F-35042
Venue:
Concurrency, Graphs and Models
Year:
2008

Citing 9
Cited 0

Partial (set) 2-structures. Part I: basic notions and the representation problem

Acta Informatica
Partial (set) 2-structures. Part II: state spaces of concurrent systems

Acta Informatica
Zero-safe nets: comparing the collective and individual token approaches

Information and Computation - Special issue on EXPRESS 1997
Zero-safe nets: The individual token approach

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Theory of Regions

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Verification of Workflow Nets

ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Transactions and Zero-Safe Nets

Unifying Petri Nets, Advances in Petri Nets
Compensation in workflow nets

ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Soundness of resource-constrained workflow nets

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

Zero-Safe nets are an adequate framework for representing linear step automata. We define a synthesis procedure based on regions for deriving Zero-Safe nets from such automata.