Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets

Authors:
Ph. Darondeau
Affiliations:
IRISA, campus de Beaulieu, F35042 Rennes Cedex, France
Venue:
Information Processing Letters
Year:
2005

Citing 4
Cited 0

Concurrent transition systems

Theoretical Computer Science
Properties of Conflict-Free and Persistent Petri Nets

Journal of the ACM (JACM)
Polynomial Algorithms for the Synthesis of Bounded Nets

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Model Checking of Persistent Petri Nets

CSL '91 Proceedings of the 5th Workshop on Computer Science Logic

Quantified Score

Hi-index	0.89

Visualization

Abstract