Skip to main content
SpringerLink
Log in

Timed Petri Nets and BQOs

  • Conference paper
  • First Online:
Applications and Theory of Petri Nets 2001 (ICATPN 2001)

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

Included in the following conference series:

Abstract

We consider (unbounded) Timed Petri Nets (TPNs) where each token is equipped with a real-valued clock representing the ‘age’ of the token. Each arc in the net is provided with a subinterval of the natural numbers, restricting the ages of the tokens travelling the arc. We apply a methodology developed in [AN00], based on the theory of better quasi orderings (BQOs), to derive an efficient constraint system for automatic verification of safety properties for TPNs. We have implemented a prototype based on our method and applied it for verification of a parametrized version of Fischer’s protocol.

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. Parosh Aziz Abdulla and Karlis Čerāns. Simulation is decidable for one-counter nets. In Proc. CONCUR’ 98, 9th Int. Conf. on Concurrency Theory, volume 1466 of Lecture Notes in Computer Science, pages 253–268, 1998.

    Google Scholar 

  2. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proc. 5th IEEE Int. Symp. on Logic in Computer Science, pages 414–425, Philadelphia, 1990.

    Google Scholar 

  3. Parosh Aziz Abdulla, Karlis Čer3x0101;ns, Bengt Jonsson, and Tsay Yih-Kuen. General decidability theorems for infinite-state systems. In Proc. 11th IEEE Int. Symp. on Logic in Computer Science, pages 313–321, 1996.

    Google Scholar 

  4. Parosh Aziz Abdulla, Karlis Čerāns, Bengt Jonsson, and Tsay Yih-Kuen. General decidability theorems for infinite-state systems. In Proc. 11th IEEE Int. Symp. on Logic in Computer Science, pages 313–321, 1996. To appear in the journal of Information and Computation.

    Google Scholar 

  5. R. Alur and D. Dill. Automata for modeeling real-time systems. In Proc. ICALP’ 90, volume 443 of Lecture Notes in Computer Science, pages 322–335, 1990.

    Google Scholar 

  6. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91–101, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  7. Parosh Aziz Abdulla and Bengt Jonsson. Ensuring completeness of symbolic verification methods for infinite-state systems, 1998. To appear in the journal of Theoretical Computer Science.

    Google Scholar 

  8. Parosh Aziz Abdulla and Bengt Jonsson. Verifying networks of timed processes. In Bernhard Steffen, editor, Proc. TACAS’ 98, 4th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1384 of Lecture Notes in Computer Science, pages 298–312, 1998.

    Chapter  Google Scholar 

  9. Parosh Aziz Abdulla and Aletta Nylén. Better is better than well: On efficient verification of infinite-state systems. In Proc. 15th IEEE Int. Symp. on Logic in Computer Science, pages 132–140, 2000.

    Google Scholar 

  10. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. on Software Engineering, 17(3):259–273, 1991.

    Article  MathSciNet  Google Scholar 

  11. F. D. J. Bowden. Modelling time in Petri nets. In Proc. Second Australian-Japan Workshop on Stochastic Models, 1996.

    Google Scholar 

  12. O. Burkart and B. Steffen. Composition, decomposition, and model checking of pushdown processes. Nordic Journal of Computing, 2(2):89–125, 1995.

    MATH  MathSciNet  Google Scholar 

  13. K. Čerāns. Deciding properties of integral relational automata. In Abiteboul and Shamir, editors, Proc. ICALP’ 94, volume 820of Lecture Notes in Computer Science, pages 35–46. Springer Verlag, 1994.

    Google Scholar 

  14. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specification. ACM Trans. on Programming Languages and Systems, 8(2):244–263, April 1986.

    Article  MATH  Google Scholar 

  15. D. de Frutos Escrig, V. Valero Ruiz, and O. Marroqu´in Alonso. Decidability of properties of timed-arc Petri nets. In ICATPN 2000, number 1825, pages 187–206, 2000.

    Google Scholar 

  16. D.L. Dill. Timing assumptions and verification of finite-state concurrent systems. In J. Sifakis, editor, Automatic Verification Methods for Finite-State Systems, volume 407 of Lecture Notes in Computer Science. Springer Verlag, 1989.

    Google Scholar 

  17. J. Esparza. Petri nets, commutative context-free grammers, and basic parallel processes. In Proc. Fundementals of Computation Theory, volume 965 of Lecture Notes in Computer Science, pages 221–232, 1995.

    Google Scholar 

  18. A. Finkel. Decidability of the termination problem for completely specified protocols. Distributed Computing, 7(3), 1994.

    Google Scholar 

  19. C. Ghezzi, D. Mandrioli, S. Morasca, and M. Pezzè. A unified high-level Petri net formalism for time-critical systems. IEEE Trans. on Software Engineering, 17(2):160–172, 1991.

    Article  Google Scholar 

  20. S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675–735, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  21. P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Methods in System Design, 2(2):149–164, 1993.

    Article  MATH  Google Scholar 

  22. T.A. Henzinger. Hybrid automata with finite bisimulations. In Proc. ICALP’ 95, 1995.

    Google Scholar 

  23. P. Jančar. Bisimulation equivalence is decidable for one-counter processes. In Proc. ICALP’ 97, pages 549–559, 1997.

    Google Scholar 

  24. N. D. Jones, L. H. Landweber, and Y. E. Lyen. Complexity of some problems in Petri nets. Theoretical Computer Science, (4):277–299, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  25. P. Jančar and F. Moller. Checking regular properties of Petri nets. In Proc. CONCUR’ 95, 6th Int. Conf. on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 348–362. Springer Verlag, 1995.

    Google Scholar 

  26. B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non ‐ finite ‐ state programs. Information and Computation, 107(2):272–302, Dec. 1993.

    Article  MATH  MathSciNet  Google Scholar 

  27. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In O. Grumberg, editor, Proc. 9th Int. Conf. on Computer Aided Verification, volume 1254, pages 424–435, Haifa, Israel, 1997. Springer Verlag.

    Google Scholar 

  28. K. G. Larsen, J. Pearson, C. Weise, and W. Yi. Efficient timed reachability analysis using clock difference diagrams. In Proc. 11th Int. Conf. on Computer Aided Verification, 1999.

    Google Scholar 

  29. Kim G. Larsen, Paul Pettersson, and Wang Yi. Model-checking for realtime systems. In Horst Reichel, editor, Proceedings of 10th International Fundamentals of Computation Theory, number 965 in LNCS, pages 62–88, Dresden, Germany, August 1995.

    Google Scholar 

  30. K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a nutshell. Software Tools for Technology Transfer, 1(1-2), 1997.

    Google Scholar 

  31. P. Merlin and D.J. Farber. Recoverability of communication protocols-implications of a theoretical study. IEEE Trans. on Computers, COM-24:1036–1043, Sept. 1976.

    MathSciNet  Google Scholar 

  32. Jesper Møller and Jakob Lichtenberg. Difference decision diagrams. Master’s thesis, Department of Information Technology, Technical University of Denmark, Building 344, DK-2800 Lyngby, Denmark, August 1998.

    Google Scholar 

  33. Jesper Møller, Jakob Lichtenberg, Henrik R. Andersen, and Henrik Hulgaard. Difference decision diagrams. Technical Report IT-TR-1999-023, Department of Information Technology, Technical University of Denmark, February 1999.

    Google Scholar 

  34. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in cesar. In 5th International Symposium on Programming, Turin, volume 137 of Lecture Notes in Computer Science, pages 337–352. Springer Verlag, 1982.

    Google Scholar 

  35. V. Valero Ruiz, F. Cuartero Gomez, and D. de Frutos Escrig. On nondecidability of reachability for timed-arc Petri nets. In Proceedings of the 8th Int. Workshop on Petri Net and Performance Models (PNPM’99), pages 188–196, 1999.

    Google Scholar 

  36. R. Razouk and C. Phelps. Performance analysis using timed Petri nets. In Protocol Testing, Specification, and Verification, pages 561–576, 1985.

    Google Scholar 

  37. F. B. Schneider, Bloom B, and Marzullo K. Putting time into proof outlines. In de Bakker, Huizing, de Roever, and Rozenberg, editors, Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science, 1992.

    Chapter  Google Scholar 

  38. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st IEEE Int. Symp. on Logic in Computer Science, pages 332–344, June 1986.

    Google Scholar 

  39. Pierre Wolper. Expressing interesting properties of programs in propositional temporal logic (extended abstract). In Proc. 13th ACM Symp. on Principles of Programming Languages, pages 184–193, Jan. 1986.

    Google Scholar 

  40. S. Yovine. Kronos: A verification tool for real-time systems. Journal of Software Tools for Technology Transfer, 1(1-2), 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Systems, Uppsala University, P.O. Box 337, SE-751 05, Uppsala, Sweden

    Parosh Aziz Abdulla & Aletta Nylén

Authors
  1. Parosh Aziz Abdulla
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aletta Nylén
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática e Ingeniería de Sistemas Centro Politécnico Superior, Universidad de Zaragoza, María de Luna, 3, 50015, Zaragoza, Spain

    José-Manuel Colom

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

    Maciej Koutny

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdulla, P.A., Nylén, A. (2001). Timed Petri Nets and BQOs. In: Colom, JM., Koutny, M. (eds) Applications and Theory of Petri Nets 2001. ICATPN 2001. Lecture Notes in Computer Science, vol 2075. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45740-2_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45740-2_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45740-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation