Abstract
When analysing a concurrent program in order to verify its correctness, in practice, one faces severe complexity problems. To cope with the problem of state-space explosion, two different types of approaches have been established: abstraction techniques and partial order methods that both have certain drawbacks. To overcome these drawbacks we show in this paper how to combine abstraction with the “persistent-set selective search” partial-order method.
Former name: Ulrich Nitsche
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21(4):181–185, October 1985.
E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. In Proceedings of the 19 th ACM Symposium on Principles of Programming Languages, Albuquerque, 1992.
V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, first edition, 1995.
S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, New York, 1974.
P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Methods in System Design, 2(2):149–164, April 1993.
T. A. Henzinger. Sooner is safer than later. Information Processing Letters, 43:135–141, 1992.
U. Nitsche and P. Ochsenschläger. Approximately satisfied properties of systems and simple language homomorphisms. Information Processing Letters, 60:201–206, 1996.
U. Nitsche and P. Wolper. Relative liveness and behavior abstraction (extended abstract). In Proceedings of the 16 th ACM Symposium on Principles of Distributed Computing (PODC’97), pages 45–52, Santa Barbara, CA, 1997.
P. Ochsenschläger. Verification of cooperating systems by simple homomorphisms using the product net machine. In J. Desel, A. Oberweis, and W. Reisig, editors, Workshop: Algorithmen und Werkzeuge für Petrinetze, pages 48–53. Humboldt Universität Berlin, 1994.
U. Ultes-Nitsche. Towards the construction of an abstract state-space from a partial-order representation of the concrete one. Electronic Notes in Theoretical Computer Science, 18:1–17, 1998.
A. Valmari. A stubborn attack on state explosion. In E. M. Clarke and R. P. Kurshan, editors, CAV’90-Computer Aided Verification 1990, volume 531 of Lecture Notes in Computer Science, pages 156–165. Springer Verlag, 1991.
P. Wolper and P. Godefroid. Partial-order methods for temporal verification. In E. Best, editor, CONCUR’93, volume 715 of Lecture Notes in Computer Science, pages 233–246. Springer Verlag, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ultes-Nitsche, U. (1999). A persistent-Set Approach to Abstract State-Space Construction in Verification. In: Pavelka, J., Tel, G., Bartošek, M. (eds) SOFSEM’99: Theory and Practice of Informatics. SOFSEM 1999. Lecture Notes in Computer Science, vol 1725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47849-3_35
Download citation
DOI: https://doi.org/10.1007/3-540-47849-3_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66694-3
Online ISBN: 978-3-540-47849-2
eBook Packages: Springer Book Archive