Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2003: CONCUR 2003 - Concurrency Theory pp 72–86Cite as

Syntactic Formats for Free

An Abstract Approach to Process Equivalence

  • Conference paper

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

Abstract

A framework of Plotkin and Turi’s, originally aimed at providing an abstract notion of bisimulation, is modified to cover other operational equivalences and preorders. Combined with bialgebraic methods, it yields a technique for the derivation of syntactic formats for transition system specifications which guarantee operational preorders to be precongruences. The technique is applied to the trace preorder, the completed trace preorder and the failures preorder. In the latter two cases, new syntactic formats ensuring precongruence properties are introduced.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S., Vickers, S.: Quantales, observational logic and process semantics. Math. Struct. in Comp. Sci. 3, 161–227 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  2. Aceto, L., Fokkink, W., Verhoef, C.: Structural operational semantics. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, Elsevier, Amsterdam (1999)

    Google Scholar 

  3. Aczel, P., Mendler, N.: A final coalgebra theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poigné, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol. 389, pp. 357–365. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  4. Barr, M.: Terminal coalgebras in well-founded set theory. Theoretical Computer Science 114, 299–315 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bloom, B.: When is partial trace equivalence adequate? Formal Aspects of Computing 6, 25–68 (1994)

    Article  MathSciNet  Google Scholar 

  6. Bloom, B., Fokkink, W., van Glabbeek, R.J.: Precongruence formats for decorated trace preorders. In: Logic in Computer Science, pp. 107–118 (2000)

    Google Scholar 

  7. Bloom, B., Fokkink, W.J., van Glabbeek, R.J.: Precongruence formats for decorated trace semantics. ACM Transactions on Computational Logic (to appear)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Fokkink, W., van Glabbeek, R.: Ntyft/ntyxt rules reduce to ntree rules. Information and Computation 126, 1–10 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. van Glabbeek, R.J.: The linear time-branching time spectrum I. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra. Elsevier, Amsterdam (1999)

    Google Scholar 

  11. Groote, J.F.: Transition system specifications with negative premises. Theoret. Comput. Sci. 118, 263–299 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32, 137–161 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  14. Jacobs, B.: Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics, vol. 141. North Holland, Elsevier (1999)

    Google Scholar 

  15. Klin, B., Sobociński, P.: Syntactic formats for free: An abstract approach to process equivalence. BRICS Report RS-03-18, Aarhus University (2003), Available from http://www.brics.dk/RS/03/18/BRICS-RS-03-18.pdf

  16. Mac Lane, S.: Categories for the Working Matematician. Springer, Heidelberg (1998)

    Google Scholar 

  17. Park, D.M.: Concurrency on automata and infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  18. Plotkin, G.: A structural approach to operational semantics. DAIMI Report FN-19, Computer Science Department, Aarhus University (1981)

    Google Scholar 

  19. Plotkin, G.: Bialgebraic semantics and recursion (extended abstract). In: Corradini, A., Lenisa, M., Montanari, U. (eds.) Electronic Notes in Theoretical Computer Science, vol. 44. Elsevier Science Publishers, Amsterdam (2001)

    Google Scholar 

  20. Plotkin, G.: Bialgebraic semantics and recursion. In: Invited talk, Workshop on Coalgebraic Methods in Computer Science, Genova (2001)

    Google Scholar 

  21. Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall, Englewood Cliffs (1997)

    Google Scholar 

  22. Rutten, J., Turi, D.: Initial algebra and final coalgebra semantics for concurrency. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 530–582. Springer, Heidelberg (1994)

    Google Scholar 

  23. de Simone, R.: Higher-level synchronising devices in Meije-SCCS. Theoret. Comput. Sci. 37, 245–267 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  24. Turi, D.: Fibrations and bisimulation (unpublished notes)

    Google Scholar 

  25. Turi, D.: Functorial Operational Semantics and its Denotational Dual. PhD thesis, Vrije Universiteit, Amsterdam (1996)

    Google Scholar 

  26. Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Proceedings 12th Ann. IEEE Symp. on Logic in Computer Science, LICS 1997, Warsaw, Poland, June 29 – July 2, pp. 280–291. IEEE Computer Society Press, Los Alamitos (1997)

    Chapter  Google Scholar 

  27. Vaandrager, F.W.: On the relationship between process algebra and input/output automata. In: Logic in Computer Science, pp. 387–398 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS University of Aarhus, Denmark

    Bartek Klin & Paweł Sobociński

Authors
  1. Bartek Klin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paweł Sobociński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université Paris 7, PPS, Case 7014, 75205, Paris Cedex 13, France

    Roberto Amadio

  2. LIF, CNRS, Aix-Marseille Université, France

    Denis Lugiez

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klin, B., Sobociński, P. (2003). Syntactic Formats for Free. In: Amadio, R., Lugiez, D. (eds) CONCUR 2003 - Concurrency Theory. CONCUR 2003. Lecture Notes in Computer Science, vol 2761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45187-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45187-7_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40753-9

  • Online ISBN: 978-3-540-45187-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation