Skip to main content
SpringerLink
Log in

On the Power of Labels in Transition Systems

  • Conference paper
  • First Online:
CONCUR 2001 — Concurrency Theory (CONCUR 2001)

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

Included in the following conference series:

Abstract

In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled transition systems to unlabelled ones, preserving bisimilarity and satisfiability of μ-calculus formulas. We apply the reduction to the class of transition systems generated by Petri nets and pushdown automata, and obtain several decidability/complexity corollaries for unlabelled systems. Probably the most interesting result is undecidability of strong bisimilarity for unlabelled Petri nets.

The author is supported in part by the GACR, grant No. 201/00/0400.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. M. Ben-Ari, Z. Manna, and A. Pnueli. The temporal logic of branching time. Acta Informatica, 20(3):207–226, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  2. O. Burkart and J. Esparza. More infinite results. Bulletin of the European Association for Theoretical Computer Science, 62:138–159, June 1997. Columns: Concurrency.

    Google Scholar 

  3. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Logic of Programs Workshop, volume 131 of LNCS, pages 52–71. Springer-Verlag, 1981.

    Chapter  Google Scholar 

  4. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. ACM Transactions on Programming Languages and Systems, 8(2):244–263, 1986.

    Article  MATH  Google Scholar 

  5. J. Esparza and A. Kiehn. On the model checking problem for branching time logics and basic parallel processes. In International Conference on Computer-Aided Verification (CAV’95), volume 939 of LNCS, pages 353–366, 1995.

    Google Scholar 

  6. J. Esparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997.

    Article  MathSciNet  Google Scholar 

  7. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, 32(1):137–161, 1985.

    MATH  MathSciNet  Google Scholar 

  8. P. Jancar. Undecidability of bisimilarity for Petri nets and some related problems. Theoretical Computer Science, 148(2):281–301, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  9. P. Jancar, A. Kucera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. In Proceedings of the Annual International Colloquium on Automata, Languages and Programming (ICALP’98), volume 1443 of LNCS. Springer-Verlag, 1998.

    Google Scholar 

  10. P. Jancar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR’95, volume 962 of LNCS, pages 348–362. Springer-Verlag, 1995.

    Google Scholar 

  11. R. Mayr. Strict lower bounds for model checking BPA. In Proceedings of the MFCS’98 Workshop on Concurrency, volume 18 of ENTCS. Springer-Verlag, 1998.

    Google Scholar 

  12. R. Mayr. On the complexity of bisimulation problems for pushdown automata. In IFIP International Conference on Theoretical Computer Science (IFIP TCS’2000), volume 1872 of LNCS. Springer-Verlag, 2000.

    Google Scholar 

  13. F. Moller. Infinite results. In Proceedings of CONCUR’96, volume 1119 of LNCS, pages 195–216. Springer-Verlag, 1996.

    Google Scholar 

  14. J.L. Peterson. Petri Net Theory and the Modelling of Systems. Prentice-Hall, 1981.

    Google Scholar 

  15. G. S’enizergues. Decidability of bisimulation equivalence for equational graphs of finite out-degree. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science(FOCS-98), pages 120–129. IEEE Computer Society, 1998.

    Google Scholar 

  16. J. Srba. On the power of labels in transition systems. Technical Report RS-01-19, BRICS Research Series, 2001.

    Google Scholar 

  17. C. Stirling. Local model checking games. In Proceedings of the 6th International Conference on Concurrency Theory (CONCUR’95), volume 962 of LNCS, pages 1–11. Springer-Verlag, 1995.

    Google Scholar 

  18. W. Thomas. On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract). In Proceedings of the 4th International Joint Conference CAAP/FASE, Theory and Practice of Software Development (TAPSOFT’93), volume 668 of LNCS, pages 559–568. Springer-Verlag, 1993.

    Google Scholar 

  19. W. Vogler. Modular construction and partial order semantics of Petri nets, volume 625 of LNCS. Springer-Verlag, 1992.

    Google Scholar 

  20. I. Walukiewicz. Pushdown processes: Games and model checking. In International Conference on Computer-Aided Verification (CAV’96), volume 1102 of LNCS, pages 62–74, 1996. To appear in Information and Computation.

    Google Scholar 

  21. I. Walukiewicz. Model checking CTL properties of pushdown systems. In Proceedings Foundations of Software Technology and Theoretical Computer Science (FSTTCS’00), volume 1974 of LNCS, pages 127–138. Springer-Verlag, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Basic Research in Computer Science, Centre of the Danish National Research Foundation, Denmark

    Jiří Srba

  2. Dept. of Computer Science, University of Aarhus, Denmark

    Jiří Srba

Authors
  1. Jiří Srba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, BRICS, Aalborg University, Fredrik Bajersvej 7, 9220, Aalborg, Denmark

    Kim G. Larsen

  2. BRICS, Aarhus University, Ny Munkegade, Bldg. 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Srba, J. (2001). On the Power of Labels in Transition Systems. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-44685-0_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42497-0

  • Online ISBN: 978-3-540-44685-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation