Abstract
The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]. An unfolding procedure is provided which exploits the product structure of the model. Its performance is evaluated on a set of benchmarks.
Work partially supported by the Teilprojekt A3 SAM of the Sonderforschungsbereich 342 “Werkzeuge und Methoden für die Nutzung paralleler Rechnerarchitekturen”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Arnold. Finite Transition Systems. Prentice-Hall, 1992.
J. C. Corbett. Evaluating Deadlock Detection Methods for Concurrent Software. In T. Ostrand, editor, Proceedings of the 1994 International Symposium on Software Testing and Analysis, 204–215, 1994.
J. Esparza, S. Römer und W. Vogler: An Improvement of McMillan’s Unfolding Algorithm. In T. Margaria und B. Steffen, editors, Proceedings of TACAS’96, LNCS 1055, 87–106, 1996.
R. Langerak and E. Brinksma. A Complete Finite Prefix for Process Algebra. To appear in Proceedings of CAV’ 99, 1999.
K. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer, 1993.
S. Melzer. Verification of Distributed Systems Using Linear and Constraint Programming. Ph. D. Thesis, Technical University of Munich, 1998 (in German).
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
Esparza, J., Römer, S. (1999). An Unfolding Algorithm for Synchronous Products of Transition Systems. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_2
Download citation
DOI: https://doi.org/10.1007/3-540-48320-9_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66425-3
Online ISBN: 978-3-540-48320-5
eBook Packages: Springer Book Archive