A survey of behaviour and equivalence preserving refinements of Petri nets
APN 90 Proceedings on Advances in Petri nets 1990
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
The Incremental Modelling of the Z39.50 Protocol with Object Petri Nets
Application of Petri Nets to Communication Networks, Advances in Petri Nets
Composing abstractions of coloured Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Maria: Modular Reachability Analyser for Algebraic System Nets
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
The Challenge of Object Orientation for the Analysis of Concurrent Systems
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Coloured Petri net refinement specification and correctness proof with Coq
Innovations in Systems and Software Engineering
| Hi-index | 0.00 |
State space analysis is a popular formal reasoning technique. However, it is subject to the crippling problem of state space explosion, where its application to real world models leads to unmanageably large state spaces. In this paper we present algorithms which attempt to alleviate the state space explosion problem by taking advantage of the common practice of incremental development, i.e. where the designer starts with an abstract model of the system and progressively refines it. The performance of the incremental algorithm is compared to that of the standard algorithm for some case studies, and situations under which the performance improvement can be expected are identified.