For the most recent entries see the Petri Nets Newsletter.

Efficient Symbolic State-Space Construction for Asynchronous Systems.

Ciardo, Gianfranco; Lüttgen, Gerald; Siminiceanu, Radu

In: Nielsen, M.; Simpson, D.: Lecture Notes in Computer Science, Vol. 1825: 21st International Conference on Application and Theory of Petri Nets (ICATPN 2000), Aarhus, Denmark, June 2000, pages 103-122. Springer-Verlag, 2000.

Abstract: Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the state spaces of asynchronous system models, such as Petri nets, is developed. The algorithm is based on previous work that employs Multi-valued Decision Diagrams for efficiently storing sets of reachable states. In contrast to related approaches, however, it fully exploits event locality, supports intelligent cache management, and achieves faster convergence via advanced iteration control. The algorithm is implemented in the Petri net tool SMART, and run-time results show that it often performs significantly faster than existing state-space generators.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography