Skip to main content
SpringerLink
Log in

On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2003)

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

Included in the following conference series:

Abstract

We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, then there exists a (sound and complete) finite equational axiomatization for the process algebra BCCSP modulo ready trace semantics. We prove that if the alphabet is infinite, then such an axiomatization does not exist. Furthermore, we present finite equational axiomatizations for BCCSP modulo ready simulation and failure trace semantics, for arbitrary sets of actions.

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. L. Aceto, W.J. Fokkink, and A. Ingólfsdóttir. 2-nestedsim ulation is not finitely equationally axiomatizable. In A. Ferreira and H. Reichel, eds, Proceedings 18th Symposium on Theoretical Aspects of Computer Science (STACS’2001), Dresden, LNCS 2010, pp. 39–50. Springer-Verlag, 2001.

    Google Scholar 

  2. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Ready-trace semantics for concrete process algebra with the priority operator. The Computer Journal, 30(6):498–506, 1987.

    MATH  MathSciNet  Google Scholar 

  3. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can’t be traced. Journal of the ACM, 42(1):232–268, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. R.J. van Glabbeek. The linear time — branching time spectrum I. The semantics of concrete, sequential processes. In J.A. Bergstra, A. Ponse, and S.A. Smolka, eds, Handbook of Process Algebra, pp. 3–99. Elsevier, 2001.

    Google Scholar 

  5. J.F. Groote. A new strategy for proving ω-completeness with applications in process algebra. In J.C.M. Baeten and J.W. Klop, eds., Proceedings 1st Conference on Concurrency Theory (CONCUR’90), Amsterdam, LNCS 458, pp. 314–331. Springer-Verlag, 1990.

    Google Scholar 

  6. J.F. Groote and F.W. Vaandrager. Structuredop erational semantics and bisimulation as a congruence. Information and Computation, 100(2):202–260, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  7. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1–28, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  8. D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, ed., Proceedings 5th GI (Gesellschaft für Informatik) Conference, Karlsruhe, LNCS 104, pp. 167–183. Springer-Verlag, 1981.

    Google Scholar 

  9. G.D. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Aarhus University, 1981.

    Google Scholar 

  10. I.C.C. Phillips. Refusal testing. Theoretical Computer Science, 50(3):241–284, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  11. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In W. Brauer, ed., Proceedings 12th Colloquium on Automata, Languages and Programming (ICALP’85), Nafplion, LNCS 194, pp. 15–32. Springer-Verlag, 1985.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software Engineering, CWI, PO Box 94079, 1090 GB, Amsterdam, The Netherlands

    Stefan Blom & Wan Fokkink

  2. Department of Theoretical Computer Science, Vrije Universiteit Amsterdam, De Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Wan Fokkink

  3. Department of Computer Science and Engineering, Hauz Khas, IIT Delhi, New Delhi, 110 016, India

    Sumit Nain

Authors
  1. Stefan Blom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wan Fokkink
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sumit Nain
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA, 30332-0205, USA

    Jan Karel Lenstra

  3. Department of Information Technology, Uppsala University, P.O. Box 337, 75105, Uppsala, Sweden

    Joachim Parrow

  4. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blom, S., Fokkink, W., Nain, S. (2003). On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45061-0_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40493-4

  • Online ISBN: 978-3-540-45061-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation