Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1997: Foundations of Software Technology and Theoretical Computer Science pp 297–311Cite as

General refinement for high level petri nets

  • Conference paper
  • First Online:

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

Abstract

The algebra of M-nets, a high level class of labelled Petri nets, was introduced in the Petri Box Calculus in order to cope with the size problem of the low level nets, especially if applied as semantical domain for parallel programming languages. A general, unrestricted refinement operator intended to represent the procedure call mechanism for concurrent calls is introduced into the M-net calculus. Its coherence with the low level refinements is exhibited, together with its main properties.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Best, R. Devillers, and J. Esparza. General Refinement and Recursion for the Box Calculus. STACS'93. Springer, LNCS Vol. 665, 130–140 (1993).

    MATH  MathSciNet  Google Scholar 

  2. E. Best, R. Devillers, and J.G. Hall. The Box Calculus: a New Causal Algebra with Multilabel Communication. Advances in Petri Nets 92. Springer, LNCS Vol. 609, 21–69 (1992).

    MathSciNet  Google Scholar 

  3. E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable High Level Petri Nets. Application and Theory of Petri Nets 1995. Springer, LNCS Vol. 935, 103–120 (1995).

    MathSciNet  Google Scholar 

  4. E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. An M-Net Semantics of B(PN)2. Structures in Concurrency Theory: STRICT'95 Proceedings. Springer, 85–100 (1995).

    Google Scholar 

  5. E. Best, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. M-nets: an Algebra of High Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages. To appear in Acta Informatica.

    Google Scholar 

  6. E. Best, R.P. Hopkins. B(PN)2 — a Basic Petri Net Programming Notation. Proceedings of PARLE'93. Springer, LNCS Vol. 694, 379–390 (1993).

    Google Scholar 

  7. E. Best and M. Koutny. A Refined View of the Box Algebra. Application and Theory of Petri Nets 1995. Springer, LNCS Vol. 935, 1–20 (1995).

    MathSciNet  Google Scholar 

  8. E. Best and M. Koutny. Solving Recursive Net Equations. Automata, Languages and Programming 1995. Springer, LNCS Vol. 944, 605–623 (1995).

    MathSciNet  Google Scholar 

  9. R. Devillers. The Synchronisation Operator Revisited for the Petri Box Calculus. Technical Report LIT-290, Université Libre de Bruxelles (1994).

    Google Scholar 

  10. R. Devillers. S-Invariant Analysis of General Recursive Petri Boxes. Acta Informatica, Vol. 32, 313–345 (1995).

    MATH  MathSciNet  Google Scholar 

  11. R. Devillers and H. Klaudel. Refinement and Recursion in a High Level Petri Box Calculus. Structures in Concurrency Theory: STRICT'95 Proceedings. Springer, 144–159 (1995).

    Google Scholar 

  12. R. Devillers, H. Klaudel and R.-C. Riemann. General Refinement in the M-net Calculus. Technical Report LIT-357, Université Libre de Bruxelles (1997).

    Google Scholar 

  13. H. Fleischhack and B. Grahlmann. A Petri Net Semantics for B(PN)2 with Procedures. Parallel and Distributed Software Engineering, Boston Ma., 1997.

    Google Scholar 

  14. H. Genrich. Predicate-Transition Nets. In Petri Nets: Central Models and their Properties, Advances in Petri Nets 1986] Part I. Springer, LNCS Vol. 254, 207–247 (1987).

    MATH  MathSciNet  Google Scholar 

  15. R.J. van Glabbeek and U. Goltz. Refinement of Actions in Causality Based Models. Stepwise Refinement of Distributed Systems. Springer, LNCS Vol. 430, 267–300 (1989).

    Google Scholar 

  16. K. Jensen Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. EATCS Monographs on Theoretical Computer Science, Vol. 1. Springer (1992).

    Google Scholar 

  17. H. Klaudel. Modèles algébriques, basés sur les réseaux de Petri, pour la sémantique des langages de programmation concurrents. PhD Thesis, Université Paris XI Orsay (1995).

    Google Scholar 

  18. H. Klaudel and E. Pelz. Communication as Unification in the Petri Box Calculus. Fundamentals of Computation Theory. Springer, LNCS Vol. 965, 303–312 (1995).

    MathSciNet  Google Scholar 

  19. J. Lilius and E. Pelz. An M-net Semantics for B(PN)2 with Procedures. In ISCIS XI, Vol. I, 365–374, Antalya, November 1996. Middle East Technical University.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Libre de Bruxelles, Belgium

    Raymond Devillers

  2. IUT de Fontainebleau, Université Paris XII, France

    Hanna Klaudel

  3. Université Paris-Sud, France and UniversitÄt Hildesheim, Germany

    Robert -C. Riemann

Authors
  1. Raymond Devillers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanna Klaudel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert -C. Riemann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Ramesh G Sivakumar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Devillers, R., Klaudel, H., Riemann, R.C. (1997). General refinement for high level petri nets. In: Ramesh, S., Sivakumar, G. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1997. Lecture Notes in Computer Science, vol 1346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0058038

Download citation

  • DOI: https://doi.org/10.1007/BFb0058038

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63876-6

  • Online ISBN: 978-3-540-69659-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation