Abstract
The linear algebraic invariant calculus is a powerful technique for the verification of Petri nets. Traditionally it is used for structural verification, i.e. for avoiding the explicit construction of a state space. In this paper, we study the use of Petri net invariants for reducing the memory resources required during state space construction. While place invariants help to reduce the amount of memory needed for each single state (without reducing the number of states as such), transition invariants can be used to reduce the number of states to be stored. Interestingly, our approach does not require computing invariants in full, let alone storing them permanently. All information we need can be deduced from an upper triangular form of the Petri net’s incidence matrix. Experiments prove that the place invariant technique leads to improvements in both memory and run time costs while transition invariants lead to a space/time tradeo. that can be controlled heuristically.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G. Chiola and G. Franceschinis. Colored gspn models and automatic symmetry detection. In Proceedings of the 3rd Int. Workshop on Petri Nets and Performance Models 1989, Kyoto, Japan-Los Alamitos, CA, USA, pages 50–60. IEEE Computer Society Press, 1990.
E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting symmetry in temporal logic model checking. Formal Methods in System Design, 9:77–104, 1996.
J.M. Couvreur. The general computations of flows for coloured nets. Proc. of the 11th int. Workshop on Application and Theory of Petri nets, 1990.
E.A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design, 9:105–131, 1996.
A. Finkel. A minimal coverability graph for petri nets. Proc. of the 11th International Conference on Application and Theory of Petri nets, pages 1–21, 1990.
G. Holzmann. On limits and possibilities of automated protocol analysis. Proc. 7th IFIP WG 6.1 Int. Workshop on Protocol Specification, Testing, and Verification, pages 137–161, 1987.
Huber, A. Jensen, Jepsen, and K. Jensen. Towards reachability trees for high-level petri nets. In Advances in Petri Nets 1984, Lecture Notes on Computer Science 188, pages 215–233, 1984.
C. Norris Ip and D. L. Dill. Better verification through symmetry. Formal Methods in System Design, 9:41–75, 1996.
K. Jensen. How to find invariants for coloured petri nets. Lecture Notes In Computer Science, 118:327–338, 1981.
K. Jensen. Condensed state spaces for symmetrical coloured petri nets. Formal Methods in System Design, 9:7–40, 1996.
R. M. Karp and R. E. Miller. Parallel programm schemata. Journ. Computer and System Sciences 4, pages 147–195, Mai 1969.
K. Larsen, F. Larsen, P. Pettersen, and W. Yi. Efficient verification of real-time systems: compact data structure and state-space reduction. Proc. 18th IEEE Real-Time Systems Symp., LNCS, pages 14–24, 1997.
K. Lautenbach and H. Ridder. Liveness in bounded petri nets which are covered by t-invariants. Proc. of the 15th international Conference on Theory and Application of Petri nets, Zaragoza, LNCS 815, pages 358–375, 1994.
E. Pastor and J. Cortadella. Efficient encoding schemes for symbolic analysis of petri nets. Proc. Proc. DATE’ 98, pages 790–795, 1998.
S. Roch and P. Starke. INA-Integrierter Netz-Analysator Version 1.7. Handbuch. Humboldt-University Berlin, Institute of Computer Science, 1997.
K. Schmidt. On the computation of place invariants for algebraic petri nets. Proceedings of the STRICT workshop Berlin, 1995.
K. Schmidt. How to calculate symmetries of petri nets. Acta Informatica 36, pages 545–590, 2000.
K. Schmidt. Integrating low level symmetries into reachability analysis. Proc. of the 6th International Conference Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1785, pages 315–331, 2000.
K. Schmidt. T-invariants of algebraic petri nets. Informatik-Bericht, 31, 1994.
K. Schmidt. Lola: A low level analyser. Proc. Int. Conf. Application and Theory of Petri net, LNCS, 1825:465–474, 1999.
K. Schmidt. Integrating low level symmetries into reachability analysis. Proc. TACAS 2000, LNCS, 1785:315–331, 2000.
P. Starke. Reachability analysis of petri nets using symmetries. J. Syst. Anal. Model. Simul., 8:294–303, 1991.
J. Toksvig. Design and implementation of a place invariant tool for coloured petri nets. Master’s thesis, University of Aarhus, 1995.
A. Valmari. The state explosion problem. In Lectures on Petri Nets I-Basic Models, LNCS 1491, pages 429–528, 1998.
P. Wolper and D. Leroy. Reliable hashing without collision detection. Proc. CAV, LNCS, pages 59–70, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmidt, K. (2003). Using Petri Net Invariants in State Space Construction. In: Garavel, H., Hatcliff, J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2003. Lecture Notes in Computer Science, vol 2619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36577-X_35
Download citation
DOI: https://doi.org/10.1007/3-540-36577-X_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00898-9
Online ISBN: 978-3-540-36577-8
eBook Packages: Springer Book Archive