Timed petri nets and BQOs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2075, Issue , 2001, Pages 53-70

  Abdulla, Parosh Aziz ^a   Nylén, Aletta ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMATIC VERIFICATION; CONSTRAINT SYSTEMS; NATURAL NUMBER; QUASI-ORDERING; SAFETY PROPERTY; SUB-INTERVAL; TIMED PETRI NET;

PETRI NETS;

EID: 78951471029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45740-2_5     Document Type: Conference Paper

References (40)

1. th Int. Conf. on Concurrency Theory, volume 1466 of Lecture Notes in Computer Science, pages 253-268, 1998.
2. th IEEE Int. Symp. on Logic in Computer Science, pages 414-425, Philadelphia, 1990.
3. th IEEE Int. Symp. on Logic in Computer Science, pages 313-321, 1996.
4. th IEEE Int. Symp. on Logic in Computer Science, pages 313-321, 1996. To appear in the journal of Information and Computation.
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.
6. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2): 91-101, 1996.
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.
8. th 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.
9. th IEEE Int. Symp. on Logic in Computer Science, pages 132-140, 2000.
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.
11. F. D. J. Bowden. Modelling time in Petri nets. In Proc. Second Australian-Japan Workshop on Stochastic Models, 1996.
12. O. Burkart and B. Steffen. Composition, decomposition, and model checking of pushdown processes. Nordic Journal of Computing, 2(2): 89-125, 1995.
13. K. Čerans. Deciding properties of integral relational automata. In Abiteboul and Shamir, editors, Proc. ICALP '94, volume 820 of Lecture Notes in Computer Science, pages 35-46. Springer Verlag, 1994.
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.
15. D. de Frutos Escrig, V. Valero Ruiz, and O. Marroquín Alonso. Decidability of properties of timed-arc Petri nets. In ICATPN 2000, number 1825, pages 187-206, 2000.
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.
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.
18. A. Finkel. Decidability of the termination problem for completely specified protocols. Distributed Computing, 7(3), 1994.
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.
20. S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3): 675-735, 1992.
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.
22. T.A. Henzinger. Hybrid automata with finite bisimulations. In Proc. ICALP '95, 1995.
23. P. Jančar. Bisimulation equivalence is decidable for one-counter processes. In Proc. ICALP '97, pages 549-559, 1997.
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.
25. th Int. Conf. on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 348-362. Springer Verlag, 1995.
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.
27. th Int. Conf. on Computer Aided Verification, volume 1254, pages 424-435, Haifa, Israel, 1997. Springer Verlag.
28. th Int. Conf. on Computer Aided Verification, 1999.
29. Kim G. Larsen, Paul Pettersson, and Wang Yi. Model-checking for real-time systems. In Horst Reichel, editor, Proceedings of 10th International Fundamentals of Computation Theory, number 965 in LNCS, pages 62- 88, Dresden, Germany, August 1995.
30. K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a nutshell. Software Tools for Technology Transfer, 1(1-2), 1997.
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.
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.
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.
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.
35. V. Valero Ruiz, F. Cuartero Gomez, and D. de Frutos Escrig. On non-decidability 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.
36. R. Razouk and C. Phelps. Performance analysis using timed Petri nets. In Protocol Testing, Specification, and Verification, pages 561-576, 1985.
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.
38. st IEEE Int. Symp. on Logic in Computer Science, pages 332-344, June 1986.
39. th ACM Symp. on Principles of Programming Languages, pages 184-193, Jan. 1986.
40. S. Yovine. Kronos: A verification tool for real-time systems. Journal of Software Tools for Technology Transfer, 1(1-2), 1997.