Detail výsledku
State-space Exploration of Petri Nets
Petri nets are used as basic models in modeling, simulation and verification of discrete-event systems and concurrent systems. Petri nets analysis methods based on state-space exploration deal with the state-space explosion problem and the infineteness of the state space. A new approach to a finite representation of the infinite state space, similar to coverability graphs, is presented in this article. Its principle is based on aggregation of such states (markings) which enable the same set of transitions. The aggregated markings form a class of indistinguishable markings. An algorithm for computation classes of markings is shown.
Petri net, analysis, enumeration technique, reachability graph, coverability graph, state-space explosion, enabled transition, indistiguishable markings
@inproceedings{BUT18255,
author="Vladimír {Marek}",
title="State-space Exploration of Petri Nets",
booktitle="Proceedings of 39th International Conference MOSIS '05",
year="2005",
pages="114--119",
publisher="Marq software s.r.o.",
address="Ostrava",
isbn="80-86840-10-7"
}