Integrating Low Level Symmetries into Reachability Analysis

Authors:
Karsten Schmidt
Affiliations:
-
Venue:
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Year:
2000

Citing 11
Cited 0

Towards reachability trees for high-level Petri nets

Advances in Petri Nets 1984
Reachability analysis of Petri nets using symmetries

Systems Analysis Modelling Simulation
Using state space reduction methods for deadlock analysis in Ada tasking

ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
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
Symmetry and model checking

Formal Methods in System Design - Special issue on symmetry in automatic verification
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
How to calculate symmetries of Petri nets

Acta Informatica
Combining Partial Order and Symmetry Reductions

TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Manual and Automatic Exploitation of Symmetries in SPN Models

ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Modeling Symmetric Computer Architectures by SWNs

Proceedings of the 15th International Conference on Application and Theory of Petri Nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present three methods for the integration of symmetries into reachability analysis. Two of them lead to maximal reduction but their runtime depends on the symmetry structure. The third one works always fast but does not always yield maximal reduction.