Skip to main content
SpringerLink
Log in

Axiomatizing GSOS with Termination

  • Conference paper
  • First Online:
STACS 2002 (STACS 2002)

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

Included in the following conference series:

Abstract

We discuss a combination of GSOS-type structural operational semantics with explicit termination, that we call the tagh-format (tagh being short for termination and GSOS hybrid).The tagh-format distinguishes between transition and termination rules, but allows besides active and negative premises as in GSOS, also for, what is called terminating and passive arguments. We extend the result of Aceto, Bloom and Vaandrager on the automatic generation of sound and complete axiomatizations for GSOSto the setting of tagh-transition system specifications.The construction of the equational theory is based upon the notion of a smooth and distinctive operation, which have been generalized from GSOS to tagh.The examples provided indicate a signifi- cant improvement over the mechanical axiomatization techniques known so far.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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, B. Bloom, and F.W. Vaandrager. Turning SOS rules into equations. Information and Computation, 111:1–52, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. J.C.M. Baeten. Embedding untimed into timed process algebra: the case for explicit termination. In L. Aceto and B. Victor, editors, Proc. EXPRESS’00, pages 45–62.ENTCS 39, 2000.

    Google Scholar 

  3. J.C.M. Baeten and J.A. Bergstra. Mode transfer in process algebra. Technical Report CSR 00-01, Division of Computer Science, TU/e, 2000.

    Google Scholar 

  4. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Syntax and defining equations for an interrupt mechanism. Fundamenta Informaticae, IX:127–168, 1986.

    MathSciNet  Google Scholar 

  5. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can’t be traced. Journal of the ACM, 42:232–268, 1995.Preliminary version in Proc. POPL’88.

    Article  MATH  MathSciNet  Google Scholar 

  6. E. Brinksma, editor. Information Processing Systems, Open Systems Interconnection, LOTOS-A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour.ISO Standard IS–8807, 1989.

    Google Scholar 

  7. J.C.M. Baeten and E.P. de Vink. Axiomatizing GSOS with termination. Technical Report CSR 01-06, Division of Computer Science, TU/e, 2001. See http://www.win.tue.nl/st/medew/pubbaeten.html.

  8. J.C.M. Baeten and W.P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science.Cam bridge University Press, 1990.

    Google Scholar 

  9. W.J. Fokkink. Introduction to Process Algebra.Texts in Theoretical Computer Science, An EATCS Series.Springer, 2000.

    Google Scholar 

  10. I. Ulidowski. Axiomatisations of weak equivalences for De Simone languages. In I. Lee and S. Smolka, editors, Proc. CONCUR’95, pages 219–233. LNCS 962, 1995.

    Google Scholar 

  11. I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. Theoretical Computer Science, 239:97–139, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  12. C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing, 2:274–302, 1995.

    MATH  MathSciNet  Google Scholar 

  13. J.L.M. Vrancken. The algebra of communicating processes with empty process. Theoretical Computer Science, 177:287–328, 1997.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Eindhoven University ofTechnology, P.O. Box 513, 5600, Eindhoven, MB, The Netherlands

    J.C.M. Baeten & E.P. de Vink

  2. LIACS, Universiteit Leiden, P.O. Box 9512, 2300, Leiden, RA, The Netherlands

    E.P. de Vink

Authors
  1. J.C.M. Baeten
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E.P. de Vink
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, Free University of Berlin, Takustraße 9, 14195, Berlin, Germany

    Helmut Alt

  2. CNRS - I3S - INRIA Sophia Antipolis, 2004 Route des Lucioles, 06902, Sophia Antipolis, France

    Afonso Ferreira

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baeten, J., de Vink, E. (2002). Axiomatizing GSOS with Termination. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-45841-7_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43283-8

  • Online ISBN: 978-3-540-45841-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation