Skip to main content
SpringerLink
Log in

Timed Petri Nets: Efficiency of Asynchronous Systems

  • Chapter
Book cover Formal Methods for the Design of Real-Time Systems (SFM-RT 2004)

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

Included in the following conference series:

Abstract

We shortly discuss how Petri nets have been extended with timing constraints and then choose to associate clocks to tokens and time intervals to arcs from places to transitions. In this model, we present a timed testing approach derived from the testing scenario of De Nicola and Hennessy; timed testing gives rise to an implementation relation that requires an implementation to be at least as satisfactory as the specification regarding functionality and efficiency.

We show that we get the same implementation relation whether we regard time as continuous or as discrete; so we will work with discrete time, which is easier to handle, and nevertheless get results for continuous time, which is presumably more realistic. With our testing approach, we can show that timed refusal traces of a system are exactly the behaviour that can be observed by a user. Interestingly, this can already be observed by asynchronous observers, and this leads naturally to a faster-than relation for asynchronous systems. We close with a discussion of some 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. Alur, R., Dill, D.: A theory of timed automata. Theoret. Comput. Sci. 126, 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica 29, 737–760 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Arun-Kumar, S., Natarajan, V.: Conformance: a precongruence close to bisimilarity. In: Desel, J. (ed.) Structures in Concurrency Theory, Worksh. in Computing, pp. 55–68. Springer, Heidelberg (1995)

    Google Scholar 

  4. Alexandrescu, A.: Modern C++ Design – Applied Generic and Design Patterns. C++ In-Depth Series (2001)

    Google Scholar 

  5. Aceto, L., Murphy, D.: On the ill–timed but well–caused. Acta Informatica 33, 317–350 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bihler, E.: Effizienzvergleich bei verteilten Systemen – eine Theorie und ein Werkzeug. Diplomarbeit an der Uni. Augsburg (1998)

    Google Scholar 

  7. Bihler, E., Vogler, W.: Efficiency of token-passing MUTEX-solutions – some experiments. In: Desel, J., Silva, M. (eds.) ICATPN 1998. LNCS, vol. 1420, pp. 185–204. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Corradini, F., Di Berardini, M., Vogler, W.: PAFAS at work: comparing the worst-case efficiency of three buffer implementations. In: Yu, Y.T., Chen, T.Y. (eds.) 2nd Asia-Pacific Conference on Quality Software APAQS 2001, pp. 231–240. IEEE, Los Alamitos (2001)

    Chapter  Google Scholar 

  9. Corradini, F., Gorrieri, R., Roccetti, M.: Performance preorder and competitive equivalence. Acta Informatica 34, 805–835 (1997)

    Article  MathSciNet  Google Scholar 

  10. Cerone, A., Maggiolo-Schettini, A.: Time-based expressivity of time Petri nets for system specification. Theoret. Comput. Sci. 216, 1–53 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  11. Corradini, F., Vogler, W.: Measuring the performance of asynchronous systems with PAFAS. Technical Report 2002-4, University of Augsburg (2002) (to appear in Theoretical Computer Science), http://www.Informatik.Uni-Augsburg.DE/skripts/techreports/

  12. Corradini, F., Vogler, W., Jenner, L.: Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Informatica 38, 735–792 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  13. Cleaveland, R., Zwarico, A.: A theory of testing for real-time. In: Proc. 6th Symp. on Logic in Computer Science, pp. 110–119. IEEE Computer Society Press, Los Alamitos (1991)

    Chapter  Google Scholar 

  14. Dijkstra, E.W.: Invariance and non-determinacy. In: Hoare, C.A.R., Sheperdson, J.C. (eds.) Mathematical Logic and Programming Languages, pp. 157–165. Prentice-Hall, Englewood Cliffs (1985)

    Google Scholar 

  15. De Nicola, R., Hennessy, M.C.B.: Testing equivalence for processes. Theoret. Comput. Sci. 34, 83–133 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  16. Gorrieri, R., Roccetti, M., Stancampiano, E.: A theory of processes with durational actions. Theoret. Comput. Sci. 140, 73–294 (1995)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Jenner, L., Vogler, W.: Fast asynchronous systems in dense time. Theoret. Comput. Sci. 254, 379–422 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  19. Kindler, E., Walter, R.: Mutex needs fairness. Inf. Proc. Letter 62, 31–39 (1997)

    Article  MathSciNet  Google Scholar 

  20. Lynch, N., Vaandrager, F.: Forward and backward simulations I: Untimed systems. Information and Computation 121, 214–233 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  21. Lüttgen, G., Vogler, W.: Bisimulation on speed: Worst-case efficiency. Information and Computation 191, 105–144 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  22. Lüttgen, G., Vogler, W.: Bisimulation on speed: Lower time bounds. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 333–347. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  23. Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)

    MATH  Google Scholar 

  24. Merlin, P., Farber, D.J.: Recoverability of communication protocols. IEEE Trans. Communications COM-24, 1036–1043 (1976)

    Article  MathSciNet  Google Scholar 

  25. Moller, F., Tofts, C.: Relating processes with respect to speed. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 424–438. Springer, Heidelberg (1991)

    Google Scholar 

  26. Natarajan, V., Cleaveland, R.: An algebraic theory of process efficiency. In: 11th Ann. Symp. Logic in Computer Science (LICS 1996), pp. 63–72. IEEE, Los Alamitos (1996)

    Google Scholar 

  27. Natarajan, V., Cleaveland, R.: Predictability of real-time systems: A process-algebraic approach. In: 11th IEEE Real-Time Systems Symp (RTSS 1996), IEEE, Los Alamitos (1996)

    Google Scholar 

  28. Peterson, J.L.: Petri Net Theory. Prentice-Hall, Englewood Cliffs (1981)

    MATH  Google Scholar 

  29. Phillips, I.: Refusal testing. Theoret. Comput. Sci. 50, 241–284 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  30. Popova, L.: On time Petri nets. J. Inform. Process. Cybern. EIK 27, 227–244 (1991)

    MATH  Google Scholar 

  31. Ramchandi, C.: Analysis of asynchronous concurrent systems by timed Petri nets. Technical Report TR 120, Project MAC, MIT (1974)

    Google Scholar 

  32. Reisig, W.: Petri Nets. EATCS Monographs on Theoretical Computer Science, vol. 4. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  33. Siek, J.G., Lee, L.-Q., Lumsdaine, A.: The Boost Graph Library. C++ In-Depth Series (2002)

    Google Scholar 

  34. Vogler, W.: Timed testing of concurrent systems. Information and Computation 121, 149–171 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  35. Vogler, W.: Partial s-invariants for the verification of infinite systems families. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 382–401. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  36. Vogler, W.: Efficiency of asynchronous systems, read arcs, and the mutexproblem. Theoret. Comput. Sci. 275, 589–631 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  37. Vogler, W.: Faster asynchronous systems. Information and Computation 184, 311–342 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Augsburg,  

    Elmar Bihler & Walter Vogler

Authors
  1. Elmar Bihler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Istituto di Scienze e Tecnologie dell’Informazione, Università di Urbino “Carlo Bo”, Italy

    Marco Bernardo

  2. Dipartimento di Matematica ed Informatica, University of Camerino, Via Madonna delle Carceri 9, 62032, Camerino, Italy

    Flavio Corradini

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bihler, E., Vogler, W. (2004). Timed Petri Nets: Efficiency of Asynchronous Systems. In: Bernardo, M., Corradini, F. (eds) Formal Methods for the Design of Real-Time Systems. SFM-RT 2004. Lecture Notes in Computer Science, vol 3185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30080-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30080-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23068-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation