Skip to main content
Springer Nature Link
Log in

An Unfolding Algorithm for Synchronous Products of Transition Systems

  • Conference paper
  • First Online:
CONCUR’99 Concurrency Theory (CONCUR 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1664))

Included in the following conference series:

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”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. Arnold. Finite Transition Systems. Prentice-Hall, 1992.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. R. Langerak and E. Brinksma. A Complete Finite Prefix for Process Algebra. To appear in Proceedings of CAV’ 99, 1999.

    Google Scholar 

  5. K. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer, 1993.

    Google Scholar 

  6. S. Melzer. Verification of Distributed Systems Using Linear and Constraint Programming. Ph. D. Thesis, Technical University of Munich, 1998 (in German).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, München

    Javier Esparza & Stefan Römer

Authors
  1. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Römer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten  & Sjouke Mauw  & 

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation