Skip to main content
SpringerLink
Log in

Priority Rewrite Systems for OSOS Process Languages

  • Conference paper
Book cover CONCUR 2003 - Concurrency Theory (CONCUR 2003)

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

Included in the following conference series:

Abstract

We propose a procedure for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format. Rewriting of process terms is sound for bisimulation and head normalising within the produced PRSs. For a subclass of process languages representing finite behaviours the generated PRSs are strongly normalising (terminating), confluent and complete for bisimulation for closed terms modulo associativity and commutativity of the choice operator. We illustrate the usefulness of our procedure with several examples.

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. Aceto, L.: Deriving complete inference systems for a class of GSOS languages generating regular behaviours. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  2. Aceto, L., Bloom, B., Vaandrager, F.W.: Turning SOS rules into equations. Information and Computation 111, 1–52 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Aceto, L., Fokkink, W., Verhoef, C.: Structured operational semantics. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 197–292. Elsevier Science, Amsterdam (2001)

    Chapter  Google Scholar 

  4. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  5. Baeten, J.C.M.: Embedding untimed into timed process algebra: the case for explicit termination. In: Aceto, L., Victor, B. (eds.) EXPRESS 2000. BRICS (2000)

    Google Scholar 

  6. Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae XI(2), 127–168 (1986)

    MathSciNet  Google Scholar 

  7. Baeten, J.C.M., Bergstra, J.A., Klop, J.W., Weijland, W.P.: Term-rewriting systems with rule priorities. Theoretical Computer Science 67, 283–301 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  8. Baeten, J.C.M., de Vink, E.P.: Axiomatizing GSOS with termination. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, p. 583. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol. 18. Cambridge University Press, Cambridge (1990)

    Book  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Bosscher, D.J.B.: Term rewriting properties of SOS axiomatisations. In: Proceedings of TACS 1994. LNCS, vol. 1000. Springer, Heidelberg (1994)

    Google Scholar 

  12. Cleaveland, R., Sims, S.: The Concurrency Workbench of New Century, http://www.cs.sunysb.edu/~cwb/

  13. Hennessy, M., Regan, T.: A process algebra for timed systems. Information and Computation 117, 221–239 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kennaway, J.R., de Vries, F.J.: Infinitary rewriting. In: Terese, J.W. (ed.) Term Rewriting Systems. Cambridge University Press, Cambridge (2002)

    Google Scholar 

  15. Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, pp. 1–116. Oxford University Press, Oxford (1992)

    Google Scholar 

  16. Léonard, L., Leduc, G.: A formal definition of time in LOTOS. Formal Aspects of Computing 10, 248–266 (1998)

    Article  MATH  Google Scholar 

  17. Milner, R.: A complete inference system for a class of regular behaviours. Journal of Computer System Sciences 28, 439–466 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  18. Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  19. Nicollin, X., Sifakis, J.: The algebra of timed processes, ATP: theory and application. Information and Computation 114, 131–178 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  20. Plotkin, G.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University (1981)

    Google Scholar 

  21. Sakai, M., Toyama, Y.: Semantics and strong sequentiality of priority term rewriting systems. Theoretical Computer Science 208, 87–110 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  22. Sims, S.: The Process Algebra Compiler, http://www.reactive-systems.com/pac/

  23. Ulidowski, I.: Local Testing and Implementable Concurrent Processes. PhD thesis, Imperial College, University of London (1994)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  25. Ulidowski, I.: Priority rewrite systems forOSOSprocess languages. Technical Report 2002/30, Department of Mathematics and Computer Science, Leicester University (2002), Updated version at http://www.mcs.le.ac.uk/~iulidowski/PRS.html

  26. Ulidowski, I., Phillips, I.C.C.: Ordered SOS rules and process languages for branching and eager bisimulations. Information and Computation 178(1), 180–213 (2002)

    MATH  MathSciNet  Google Scholar 

  27. Ulidowski, I., Yuen, S.: General process languages with time. Technical Report 2000/41, Department of Mathematics and Computer Science, Leicester University (2000)

    Google Scholar 

  28. van de Pol, J.: Operational semantics of rewriting with priorities. Theoretical Computer Science 200, 289–312 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Leicester, University Road, Leicester, LE1 7RH, UK

    Irek Ulidowski

Authors
  1. Irek Ulidowski
    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

Ulidowski, I. (2003). Priority Rewrite Systems for OSOS Process Languages. 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_6

Download citation

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

  • 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