Skip to main content

Timed Petri Nets: Efficiency of Asynchronous Systems

  • Chapter

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

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.

Keywords

  • Critical Section
  • Parallel Composition
  • Process Algebra
  • Reachability Graph
  • Asynchronous System

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-540-30080-9_2
  • Chapter length: 34 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   49.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-30080-9
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   64.99
Price excludes VAT (USA)

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)

    MATH  CrossRef  MathSciNet  Google Scholar 

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

    MATH  CrossRef  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)

    MATH  CrossRef  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)

    CrossRef  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)

    CrossRef  Google Scholar 

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

    CrossRef  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)

    MATH  CrossRef  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)

    MATH  CrossRef  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)

    CrossRef  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)

    MATH  CrossRef  MathSciNet  Google Scholar 

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

    MATH  CrossRef  MathSciNet  Google Scholar 

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

    MATH  CrossRef  MathSciNet  Google Scholar 

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

    MATH  CrossRef  MathSciNet  Google Scholar 

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

    CrossRef  MathSciNet  Google Scholar 

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

    MATH  CrossRef  MathSciNet  Google Scholar 

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

    MATH  CrossRef  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)

    CrossRef  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)

    CrossRef  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)

    MATH  CrossRef  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)

    MATH  CrossRef  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)

    CrossRef  Google Scholar 

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

    MATH  CrossRef  MathSciNet  Google Scholar 

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

    MATH  CrossRef  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

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