Skip to main content
SpringerLink
Log in

The Box Algebra —; A Model of Nets and Process Expressions

  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1999 (ICATPN 1999)

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

Included in the following conference series:

Abstract

The paper outlines a Petri net as well as a structural operational semantics for an algebra of process expressions. It specifically addresses this problem for the box algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The paper proceeds in arguably the most general setting. For it allows infinite operators, and recursive definitions which can be unguarded and involve infinitely many recursion variables. The main result is that it is possible to obtain a framework where process expressions can be given two, entirely consistent, kinds of semantics, one based on Petri nets, the other on SOS rules.

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. J. Baeten, W.P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18 (1990).

    Google Scholar 

  2. E. Best, R. Devillers: Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science 55:87–136 (1988).

    Article  MathSciNet  Google Scholar 

  3. E. Best, R. Devillers, J. Esparza: General Refinement and Recursion Operators for the Petri Box Calculus. Springer-Verlag, LNCS 665:130–140 (1993).

    Google Scholar 

  4. E. Best, R. Devillers, J.G. Hall: The Petri Box Calculus: A New Causal Algebra with Multilabel Communication. Springer-Verlag, LNCS 609:21–69 (1992.

    Google Scholar 

  5. E. Best, R. Devillers, M. Koutny: Petri Nets, Process Algebras and Concurrent Programming Languages. Lectures on Petri Nets II: Applications, Advances in Petri Nets. Springer-Verlag, LNCS 1492:1–84 (1998).

    Google Scholar 

  6. E. Best, R. Devillers, M. Koutny: Petri Net Algebra. Book Manuscript (1999).

    Google Scholar 

  7. G. Boudol, I. Castellani: Flow Models of Distributed Computations: Event Structures and Nets. Rapport de Recherche, INRIA, Sophia Antipolis (1991).

    Google Scholar 

  8. P. Degano, R. De Nicola, U. Montanari: A Distributed Operational Semantics for CCS Based on C/E Systems. Acta Informtaica 26:59–91 (1988).

    Article  MATH  Google Scholar 

  9. R. Devillers: S-invariant Analysis of Recursive Petri Boxes. Acta Informatica 32:313–345 (1995).

    MATH  MathSciNet  Google Scholar 

  10. R. Devillers, M. Koutny: Recursive Nets in the Box Algebra. Proc. of CSD’ 98 Conference, Fukushima, Japan, IEEE CS, 239–249 (1998).

    Google Scholar 

  11. U. Goltz: On Representing CCS Programs by Finite Petri Nets. Springher-Verlag, LNCS 324:339–350 (1988).

    Google Scholar 

  12. U. Goltz, R. Loogen: A Non-interleaving Semantic Model for Nondeterministic Concurrent Processes. Fundamenta Informaticae 14:39–73 (1991).

    MATH  MathSciNet  Google Scholar 

  13. M. Hesketh, M. Koutny: An Axiomatisation of Duplication Equivalence in Petri Box Calculus. Springer-Verlag, LNCS 1420:165–184 (1998).

    Google Scholar 

  14. C.A.R. Hoarae: Communicating Sequential Processes. Prentice Hall (1985).

    Google Scholar 

  15. R. Janicki, P.E. Lauer: Specification and Analysis of Concurrent Systems —; the COSY Approach. Springer-Verlag, LNCS EATCS Monographs on Theoretical Computer Science (1992).

    Google Scholar 

  16. M. Koutny, E. Best: Fundamental Study: Operational and Denotational Semantics for the Box Algebra. Theoretical Computer Science 211:1–83 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  17. A. Mazurkiewicz: Trace Theory. Springer-Verlag, LNCS 255:279–324 (1987).

    Google Scholar 

  18. R. Milner: Communication and Currency. Prentice hall (1989).

    Google Scholar 

  19. T. Murata: Petri Nets: Properties, Analysis and Applications. Proc. IEEE 77:541–580(1989).

    Article  Google Scholar 

  20. E.-R. Olderog: Nets, Terms and Formulas. Cambridge Tracts in Th. Comp. Sci. 23 (1991).

    Google Scholar 

  21. G. Plotkin: A Structural Approach to Operational Semantics. DAIMI Technical Report FN-19, Computer Science Department, University of Arhus (1981).

    Google Scholar 

  22. W. Reisig: Petri Nets. An introduction. Springer-Verlag, EATCS Monographs on Theoretical Computer Science (1985).

    Google Scholar 

  23. D. Taubner: Finite Representation of CCS and TCSP Programs by Automata and Petri Nets. Springer-Verlag, LNCS 369 (1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachb. Inf., Carl von Ossietzky Universität, D-26111, Oldenburg, Germany

    Eike Best

  2. Départ. d’Inform., Université Libre de Bruxelles, B-1050, Bruxelles, Belgium

    Raymond Devillers

  3. Dept. of Comp. Sci., University of Newcastle, Newcastle upon Tyne, NE1 7RU, UK

    Maciej Koutny

Authors
  1. Eike Best
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raymond Devillers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, C.so Svizzera 185, I-10149, Torino, Italy

    Susanna Donatelli

  2. LIACS, Leiden University , 2300 RA, Leiden, The Netherlands

    Jetty Kleijn

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Best, E., Devillers, R., Koutny, M. (1999). The Box Algebra —; A Model of Nets and Process Expressions. In: Donatelli, S., Kleijn, J. (eds) Application and Theory of Petri Nets 1999. ICATPN 1999. Lecture Notes in Computer Science, vol 1639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48745-X_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-48745-X_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48745-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation