Skip to main content
SpringerLink
Log in

A Compositional Model of Time Petri Nets

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

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

Included in the following conference series:

Abstract

This paper presents two related algebras which can be used to specify and analyse concurrent systems with explicit timing information. The first algebra is based on process expressions, called t-expressions, and a system of SOS rules providing their operational semantics. The second algebra is based on a class of time Petri nets, called ct-boxes, and their transition firing rule. The two algebras are related through a mapping which, for a t-expression, returns a corresponding ct-box with behaviourally equivalent transition system. The resulting model, called the Time Petri Box Calculus (tPBC), extends the existing approach of the Petri Box Calculus (PBC).

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

    Google Scholar 

  2. B. Berthomieu and M. Diaz: Modelling and verification of Time Dependent Systems Using Time Petri Nets. IEEE Trans. on Soft. Eng. 17 (1991) 259–273.

    Article  Google Scholar 

  3. E. Best, R. Devillers and J. Esparza: General Refinement and Recursion Operators for the Petri Box Calculus. Proc. of STACS’93, P. Enjalbert, A. Finkel and K. W. Wagner (Eds.). Springer-Verlag, Lecture Notes in Computer Science 665 (1993) 130–140.

    Google Scholar 

  4. E. Best, R. Devillers and J. Hall: The Petri Box Calculus: a New Causal Algebra with Multilabel Communication. In: Advances in Petri Nets 1992, G. Rozenberg (Ed.). Springer-Verlag, Lecture Notes in Computer Science 609 (1992) 21–69.

    Chapter  Google Scholar 

  5. E. Best, R. Devillers and M. Koutny: Petri Nets, Process Algebras and Concurrent Programming Languages. In: Advances in Petri Nets. Lectures on Petri Nets II: Applications, W. Reisig and G. Rozenberg (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1492 (1998) 1–84.

    Chapter  Google Scholar 

  6. E. Best, R. Devillers and M. Koutny: The Box Algebra-a Model of Nets and Process Expressions. Proc. of ICATPN’99, S. Donatelli and J. Kleijn (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1639 (1999) 344–363.

    Google Scholar 

  7. E. Best, R. Devillers and M. Koutny: Petri Net Algebra. EATCS Monographs on Theoretical Computer Science, Springer-Verlag (to be published in 2000).

    Google Scholar 

  8. B. Bieber and H. Fleischhack: Model Checking of Time Petri Nets Based on Partial Order Semantics. Proc. of CONCUR’99, J. Baeten and S. Mauw (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1664 (1999) 210–225.

    MATH  Google Scholar 

  9. H. Fleischhack: Computing a Complete Finite Prefix of a Time Petri Net. Draft paper (1999).

    Google Scholar 

  10. M. B. Hennessy: Algebraic Theory of Processes. The MIT Press (1988).

    Google Scholar 

  11. C.A.R. Hoare: Communicating Sequential Processes. Prentice Hall (1985).

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  14. P. Merlin and D. Farber: Recoverability of Communication Protocols-Implication of a Theoretical Study. IEEE Trans. on Soft. Comm. 24 (1976) 1036–1043.

    Article  MathSciNet  Google Scholar 

  15. R. Milner: Communication and Concurrency. Prentice Hall (1989).

    Google Scholar 

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

    Article  Google Scholar 

  17. G.D. Plotkin: A Structural Approach to Operational Semantics. Teachnical Report FN-19, Computer Science Department, University of Aarhus (1981).

    Google Scholar 

  18. L. Popova: Time Petri Nets. Journal of Information Processing and Cybernetics EIK 27 (1991) 227–244.

    MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Newcastle, Newcastle upon Tyne, NE1 7RU, UK

    Maciej Koutny

Authors
  1. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Aarhus, Ny Munkegade bldg 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

  2. University of Brighton, Watts Building Lewes Road, Brighton, East Sussex, BN2 4GJ, UK

    Dan Simpson

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koutny, M. (2000). A Compositional Model of Time Petri Nets. In: Nielsen, M., Simpson, D. (eds) Application and Theory of Petri Nets 2000. ICATPN 2000. Lecture Notes in Computer Science, vol 1825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44988-4_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-44988-4_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation