Skip to main content
SpringerLink
Log in
Book cover

Annual Asian Computing Science Conference

ASIAN 1999: Advances in Computing Science — ASIAN’99 pp 190–200Cite as

Asynchronous Links in the PBC and M-Nets

  • Conference paper
  • First Online:

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

Abstract

This paper aims at introducing an extension of M-nets, a fully compositional class of high-level Petri nets, and of its low-level counter part, Petri Boxes Calculus (PBC). We introduce a new operator with nice algebraic properties which allows to express asynchronous com- munications in a simple and flexible way. With this extension, asynchro- nous communications become at least as simple to express as (existing) synchronous ones. Finally, we show how this extension can be used in order to specify systems with timing constraints.

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. V. Benzaken, N. Hugon, H. Klaudel, E. Pelz, and R. Riemann. M-net Based Semantics for Triggers. ICPN’98 LNCS Vol. 1420 (1998).

    Google Scholar 

  2. E. Best. A Memory Module Specification using Composable High Level Petri Nets. Formal Systems Specification, The RPC-Memory Specification Case Study, LNCS Vol. 1169 (1996).

    Google Scholar 

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

    MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  5. E. Best and H. Fleischhack, editors. PEP: Programming Environment Based on Petri Nets. Number 14/95 in Hildesheimer Informatik-Berichte. Univ. Hildesheim (1995).

    Google Scholar 

  6. 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. Acta Informatica:35 (1998).

    Google Scholar 

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

    Google Scholar 

  8. R. Devillers and H. Klaudel. Retinement and Recursion in a High Level Petri Box Calculus. STRICT’95. Springer, ViC, 144–159 (1995).

    Google Scholar 

  9. R. Devillers, H. Klaudel and R.-C. Riemann. General Retinement for High Level Petri Nets. FST & TCS’97, Springer, LNCS Vol. 1346, 297–311 (1997).

    Google Scholar 

  10. R. Durchholz. Causality, time, and deadlines. Data & Knowledge Engineering, 6:496–477 (1991).

    Article  Google Scholar 

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

    Google Scholar 

  12. H. Klaudel and R.-C. Riemann. Retinement Based Semantics of Parallel Proce-dures. In proceedings of PDPTA’99 (1999).

    Google Scholar 

  13. M. Koutny, J. Esparza, E. Best. Operational Semantics for the Petri Box Calculus. CONCUR’94. Springer, LNCS Vol. 836, 210225 (1994).

    MathSciNet  Google Scholar 

  14. J. Lilius and E. Pelz. An M-net Semantics for B(PN)2 with Procedures. ISCIS XI, Antalya, Vol. I, 365–374 (1996).

    Google Scholar 

  15. G. Richter. Counting interfaces for discrete time modeling. Technical Report rep-set-1998-26, GMD German National Research Center for Information Technology, SET (1998).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Paris XII, 61 Avenue du Général de Gaulle, 94 010, Créteil, France

    Hanna Klaudel & Franck Pommereau

Authors
  1. Hanna Klaudel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Franck Pommereau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Chennai Mathematical Institute, 92 G.N. Chetty Road, T. Nagar, Chennai, 600 017, India

    P. S. Thiagarajan

  2. School of Computing, National University of Singapore, Lower Kent Ridge Road, Singapore, 119260

    Roland Yap

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klaudel, H., Pommereau, F. (1999). Asynchronous Links in the PBC and M-Nets. In: Thiagarajan, P.S., Yap, R. (eds) Advances in Computing Science — ASIAN’99. ASIAN 1999. Lecture Notes in Computer Science, vol 1742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46674-6_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-46674-6_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66856-5

  • Online ISBN: 978-3-540-46674-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation