High-level Petri nets: theory and application
High-level Petri nets: theory and application
A symbolic reachability graph for coloured Petri nets
Theoretical Computer Science
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
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
Merlot: a tool for analysis of real-time specifications
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
A Quotient Graph for Asymmetric Distributed Systems
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
| Hi-index | 0.00 |
State-space based techniques represent a powerful analysis tool of discrete-event systems. One way to face the state-space explosion is the exploitation of behavioral symmetries of distributed systems. Well-Formed Coloured Petri Nets (WN) allow the direct construction of a symbolic reachability graph (SRG) that captures symmetries suitably encoded in WN syntax. Most real systems however mix symmetric and asymmetric behaviors. The SRG, and more generally, all those approaches based on a static description of symmetries, have shown not to be effective in such cases. In this paper two quotient graphs are proposed as effective analysis frameworks for asymmetric systems. Both rely on WN syntax extended with relational operators. The first one is an extension of the SRG that exploits local symmetries. The second technique uses linear constraints and substate inclusion in order to aggregate states. An asymmetric distributed leader-election algorithm is used as running example.