Abstract
The paper presents a way of reducing the number of interleavings of concurrent actions that are investigated when concurrent systems are analysed or verified by exhaustive simulation or related methods. Eliminating redundant interleavings can lead to significant savings of analysis effort. The theory behind the method is developed in an abstract framework. Elementary Petri nets and shared variable multi-process programs are then used as application examples. The relation of the method to other reduction methods is briefly discussed.
Currently on leave with Telecom Australia Research Laboratories, 770 Blackburn Road, Clayton, Victoria 3168, AUSTRALIA, Tel. +61 3 541 6397
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ashcroft, E. & Manna, Z.: Formalization of Properties of Parallel Programs. In: Meltzer, B. & Michie, D. (eds): Machine Intelligence 6, Edinburgh University Press 1971, pp. 17–42.
Back, R. J. R. & Kurki-Suonio, R.: Distributed Cooperation with Action Systems. ACM Transactions on Programming Languages and Systems, Vol. 10, No. 4 1988, pp. 513–554.
Genrich, H. J.: Predicate/Transition Nets. In: Petri Nets: Central Models and Their Properties, Lecture Notes in Computer Science 254, Springer, Berlin 1987, pp. 207–247.
Jensen, K.: Coloured Petri Nets. In: Petri Nets: Central Models and Their Properties, Lecture Notes in Computer Science 254, Springer, Berlin 1987, pp. 248–299.
Joseph, T. A., Räuchle, T. & Toueg, S.: State Machines and Assertions: An Integrated Approach to Modelling and Verification of Distributed Systems. Science of Computer Programming 7 nr 1, July 1986, pp. 1–22.
Overman, W. T.: Verification of Concurrent Systems: Function and Timing. Ph.D. Dissertation, University of California Los Angeles 1981, 174 p.
Pnueli, A.: Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends. In: Current Trends in Concurrency, Lecture Notes in Computer Science 224, Springer, Berlin 1986, pp. 510–584.
Thiagarajan, P. S.: Elementary Net Systems. In: Petri Nets: Central Models and Their Properties, Lecture Notes in Computer Science 254, Springer, Berlin 1987, pp. 26–59.
Valmari, A. & Tiusanen, M.: A Graph Model for Efficient Reachability Analysis of Description Languages. In: Proceedings of the Eighth European Workshop on Application and Theory of Petri Nets, Zaragoza, Spain 1987, pp. 349–366.
Valmari, A.: Error Detection by Reduced Reachability Graph Generation. In: Proceedings of the Ninth European Workshop on Application and Theory of Petri Nets, Venice, Italy 1988, pp. 95–112.
Valmari, A.: Heuristics for Lazy State Generation Speeds up Analysis of Concurrent Systems. In: Proceedings of the Finnish Artificial Intelligence Symposium STeP-88, Helsinki 1988, Vol. 2 pp. 640–650.
Valmari, A.: State Space Generation: Efficiency and Practicality. Ph.D. Thesis. Tampere University of Technology Publications nr 55, Tampere 1988, 169 p.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valmari, A. (1989). Eliminating redundant interleavings during concurrent program verification. In: Odijk, E., Rem, M., Syre, JC. (eds) PARLE '89 Parallel Architectures and Languages Europe. PARLE 1989. Lecture Notes in Computer Science, vol 366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51285-3_35
Download citation
DOI: https://doi.org/10.1007/3-540-51285-3_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51285-1
Online ISBN: 978-3-540-46184-5
eBook Packages: Springer Book Archive