A symbolic reachability graph for coloured Petri nets
Theoretical Computer Science
An experiment in automatic generation of test suites for protocols with verification technology
Science of Computer Programming - Special issue on COST 247, verification and validation methods for formal descriptions
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
Symbolic Reachability Graph and Partial Symmetries
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Better Verification Through Symmetry
CHDL '93 Proceedings of the 11th IFIP WG10.2 International Conference sponsored by IFIP WG10.2 and in cooperation with IEEE COMPSOC on Computer Hardware Description Languages and their Applications
LfP: A Specification Language for Rapid Prototyping of Concurrent Systems
RSP '01 Proceedings of the 12th International Workshop on Rapid System Prototyping
Pre-and post-gglomerations for LTL model checking
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Towards Efficient Verification of Systems with Dynamic Process Creation
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
On the Formal Verification of Middleware Behavioral Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
A factory to design and build tailorable and verifiable middleware
Proceedings of the 12th Monterey conference on Reliable systems on unreliable networked platforms
Optimized colored nets unfolding
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Expressiveness and efficient analysis of stochastic well-formed nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Extreme symmetries in complex distributed systems: the bag-oriented approach
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
| Hi-index | 0.00 |
Formal verification of complex systems using high-level Petri Nets faces the so-called state-space explosion problem. In the context of Petri nets generated from a higher level specification, this problem is particularly acute due to the inherent size of the considered models. A solution is to perform a symbolic analysis of the reachability graph, which exploits the symmetry of a model. Well-Formed Nets (WN) are a class of high-level Petri nets, developed specifically to allow automatic construction of a symbolic reachability graph (SRG), that represents equivalence classes of states. This relies on the definition by the modeler of the symmetries of the model, through the definition of "static sub-classes". Since a model is self-contained, these (a) symmetries are actually defined by the model itself. This paper presents an algorithm capable of automatically extracting the symmetries inherent to a model, thus allowing its symbolic study by translating it to WN. The computation starts from the assumption that the model is entirely symmetric, then examines each component of a net to deduce the symmetry break it induces. This translation is transparent to the end-user, and is implemented as a service for the AMI-Net package. It is particularly adapted to models containing large value domains, yielding combinatorial gain in the size of the reachability graph.