Towards reachability trees for high-level Petri nets
Advances in Petri Nets 1984
Petri nets and algebraic specifications
Theoretical Computer Science
Reachability analysis of Petri nets using symmetries
Systems Analysis Modelling Simulation
High-level Petri nets: theory and application
High-level Petri nets: theory and application
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Condensed state spaces for symmetrical coloured Petri nets
Formal Methods in System Design - Special issue on symmetry in automatic verification
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
Exploiting symmetry in temporal logic model checking
Formal Methods in System Design - Special issue on symmetry in automatic verification
Formal Methods in System Design - Special issue on symmetry in automatic verification
A symbolic reachability graph for coloured Petri nets
Theoretical Computer Science
Utilizing symmetry when model-checking under fairness assumptions: an automata-theoretic approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
How to calculate symmetries of Petri nets
Acta Informatica
Discrete and Combinatorial Mathematics; An Applied Introduction
Discrete and Combinatorial Mathematics; An Applied Introduction
Proceedings of the 9th International Conference on Computer Aided Verification
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Proceedings of the 10th International Conference on Computer Aided Verification
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Exploiting Symmetry in Linear Time Temporal Logic Model Checking: One Step Beyond
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Exploiting Symmetry When Verifying Transitor-Level Circuits by Symbolic Trajectory Evaluation
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Structural Symmetry and Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Symmetry Reductions inModel Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
On-the-Fly Model Checking Under Fairness That Exploits Symmetry
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
| Hi-index | 0.00 |
The problem of finding symmetry information from algebraic system nets prior to the reachability graph generation is studied. The approach presented is based on well-formedness of transition descriptions, meaning that some data types in a net may be used in a symmetric way. Permutations on the domains of such data types produce symmetries on the state space level of the net, which in turn can be exploited during the reachability analysis. To ensure that the transitions behave symmetrically with respect to the chosen data domain permutations, a sufficient compatibility condition between data domain permutations and the algebraic terms used as transition guards and arc annotations is proposed. The solution is a general and flexible one as it does not fix the set of applicable operations, enabling the design of customized net classes. To help the process of deciding whether a term is compatible with a data domain permutation, an approximation rule for the compatibility condition is given.