Model checking of systems with many identical timed processes

Theoretical Computer Science

Volumn 290, Issue 1, 2003, Pages 241-264

  Abdulla, Parosh Aziz ^a   Jonsson, Bengt ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA STRUCTURES; FINITE AUTOMATA; PETRI NETS;

MODEL CHECKING;

FORMAL LOGIC;

EID: 0037209826     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00330-9     Document Type: Article

References (44)

1. P.A. Abdulla, K. Cerāns, B. Jonsson, T. Yih-Kuen, General decidability theorems for infinite-state systems, in: Proc. 11th IEEE Int. Symp. on Logic in Computer Science, 1996, pp. 313-321.
2. Abdulla P.A., Cerāns K., Jonsson B., Yih-Kuen T. Algorithmic analysis of programs with well quasi-ordered domains. Inform. and Comput. 160:2000;109-127.
3. Abdulla P.A., Jonsson B. Undecidable verification problems for programs with unreliable channels. Inform. and Comput. 130(1):1996;71-90.
4. Abdulla P.A., Jonsson B. Verifying programs with unreliable channels. Inform. and Comput. 127(2):1996;91-101.
5. Abdulla P.A., Kindahl M. Decidability of simulation and bisimulation between lossy channel systems and finite state systems. Lee I., Smolka S.A. Proc. CONCUR'95, 6th Internat. Conf. on Concurrency Theory. Lecture Notes in Computer Science. Vol. 962:1995;333-347 Springer, Berlin.
6. Abadi M., Lamport L. An old-fashioned recipe for real time. de Bakker J., Huizing C., de Roever W.P., Rozenberg G. Real-Time: Theory in Practice. Lecture Notes in Computer Science. Vol. 600:1992;1-27 Springer, Berlin.
7. R. Alur, C. Courcoubetis, D. Dill, Model-checking for real-time systems, in: Proc. 5th IEEE Int. Symp. on Logic in Computer Science, Philadelphia, 1990, pp. 414-425.
8. Alur R., Courcoubetis C., Henzinger T., Ho P.-H. Hybrid automata. an algorithmic approach to the specification and verification of hybrid systems Grossman, Nerode, Ravn, Rischel Hybrid Systems. Lecture Notes in Computer Science. Vol. 736:1992;209-229 Springer, Berlin.
9. R. Alur, T. Henzinger, A really temporal logic, in: Proc. 30th Annual Symp. Foundations of Computer Science, 1989, pp. 164-169.
10. J.M. Barzdin, J.J. Bicevskis, A.A. Kalninsh, Automatic construction of complete sample systems for program testing, Proc. IFIP Congress, 1977.
11. Berthomieu B., Diaz M. Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. on Software Eng. 17(3):1991;259-273.
12. Burkart O., Steffen B. Composition, decomposition, and model checking of pushdown processes. Nordic J. Comput. 2(2):1995;89-125.
13. Cerāns K. Decidability of bisimulation equivalence for parallel timer processes. Proc. Workshop on Computer Aided Verification. Lecture Notes in Computer Science. Vol. 663:1992;302-315 Springer, Berlin.
14. Cerāns K. Feasibility of finite and infinite paths in data dependent programs. Proc. LFCS'92. Lecture Notes in Computer Science. Vol. 620:1992;69-80 Springer, Berlin.
15. Cerāns K. Deciding properties of integral relational automata. Abiteboul S., Shamir E. Proc. ICALP'94. Lecture Notes in Computer Science. Vol. 820:1994;35-46 Springer, Berlin.
16. Clarke E.M., Emerson E.A., Sistla A.P. Automatic verification of finite-state concurrent systems using temporal logic specification. ACM Trans. on Programming Languages and Systems. 8(2):1986;244-263.
17. Clarke E.M., Grumberg O., Jha S. Verifying parameterized networks using abstraction and regular languages. Lee I., Smolka S.A. Proc. CONCUR'95, 6th Internat. Conf. on Concurrency Theory. Lecture Notes in Computer Science. Vol. 962:1995;395-407 Springer, Berlin.
18. Esparza J. Petri nets, commutative context-free grammars, and basic parallel processes. Proc. Fundamentals of Computation Theory. Lecture Notes in Computer Science. Vol. 965:1995;221-232 Springer, Berlin.
19. Finkel A. Reduction and covering of infinite reachability trees. Inform. and Comput. 89:1990;144-179.
20. German S.M., Sistla A.P. Reasoning about systems with many processes. J. ACM. 39(3):1992;675-735.
21. Ghezzi C., Mandrioli D., Morasca S., Pezzè M. A unified high-level Petri net formalism for time-critical systems. IEEE Trans. Software Eng. 17(2):1991;160-172.
22. Godefroid P., Wolper P. Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Methods System Design. 2(2):1993;149-164.
23. J.C. Godskesen, Timed modal specifications, Ph.D. Thesis, Aalborg University, 1994.
24. T.A. Henzinger, Hybrid automata with finite bisimulations, in: Proc. ICALP'95, 1995, pp. 324-335.
25. Higman G. Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2:1952;326-336.
26. Jancar P. Decidability of a temporal logic problem for Petri nets. Theoret. Comput. Sci. 74:1990;71-93.
27. Jancar P., Esparza J. Deciding finiteness of Petri nets up to bisimulation. Proc. ICALP '96. Lecture Notes in Computer Science. Vol. 1099:1996;478-489 Springer, Berlin.
28. Jancar P., Moller F. Checking regular properties of Petri nets. Proc. CONCUR'95, 6th Internat. Conf. on Concurrency Theory. Lecture Notes in Computer Science. Vol. 962:1995;348-362 Springer, Berlin.
29. Jonsson B., Parrow J. Deciding bisimulation equivalences for a class of non-finite-state programs. Inform. and Comput. 107(2):1993;272-302.
30. M. Kindahl, Verification of infinite-state systems: decision problems and efficient algorithms, Ph.D. Thesis, Department of Computer Systems, Uppsala University, Sweden, 1999.
31. Kristoffersen K.J., Larroussinie F., Larsen K.G., Pettersson P., Yi W. A compositional proof of a real-time mutual exclusion protocol. Proc. TAPSOFT'97, 7th Internat. J. Confer. on the Theory and Practice of Software Development, Lille, France. Lecture Notes in Computer Science. Vol. 1214:1997;565-579 Springer, Berlin.
32. R.P. Kurshan, K. McMillan, A structural induction theorem for processes, in: Proc. 8th ACM Symp. on Principles of Distributed Computing, Canada, Edmonton, Alberta, 1989, pp. 239-247.
33. K.G. Larsen, B. Steffen, C. Weise, Fischer's protocol revisited: a simple proof using modal constraints, in: Proc. 4th DIMACS Workshop on Verification and Control of Hybrid Systems, New Brunswick, NJ, October 1995.
34. Lothaire M. Combinatorics on Words, Encyclopedia of Mathematics and its Applications, Vol. 17. 1983;Addison-Wesley, Reading, MA.
35. Merlin P., Farber D.J. Recoverability of communication protocols - implications of a theoretical study. IEEE Trans. Comput. COM-24:1976;1036-1043.
36. Queille J.P., Sifakis J. Specification and verification of concurrent systems in Cesar. Dezani-Ciancaglini M., Montanari M. Proc. Int. Symp. Programming. Lecture Notes in Computer Science. Vol. 137:1982;337-351 Springer, Berlin.
37. Schneider F.B., Bloom B., Marzullo K. Putting time into proof outlines. de Bakker J.W., Huizing C., de Roever W.P., Rozenberg G. Real-Time: Theory in Practice. Lecture Notes in Computer Science. Vol. 600:1992;618-639 Springer, Berlin.
38. Shankar A.U. An introduction to assertional reasoning for concurrent systems. Comput. Surveys. 25(3):1993;225-262.
39. Shankar N. Verification of real-rime systems using PVS. Courcoubetis Proc. 5th Int. Conf. on Computer Aided Verification. Lecture Notes in Computer Science. Vol. 697:1993;280-291 Springer, Berlin.
40. C. Stirling, Decidability of bisimulation equivalence for normed pushdown processes, in: Proc. CONCUR '96, 7th Int. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996, pp. 217-232.
41. M.Y. Vardi, P. Wolper, An automata-theoretic approach to automatic program verification, in: Proc. 1st IEEE Int. Symp. on Logic in Computer Science, June 1986, pp. 332-344.
42. P. Wolper, Expressing interesting properties of programs in propositional temporal logic (extended abstract), in: Proc. 13th ACM Symp. on Principles of Programming Languages, January 1986, pp. 184-193.
43. Wolper P., Lovinfosse V. Verifying properties of large sets of processes with network invariants (extended abstract). Sifakis J. Proc. Workshop on Computer Aided Verification. Lecture Notes in Computer Science. Vol. 407:1989;68-80 Springer, Berlin.
44. Yi W. CCS + Time = an interleaving model for real time systems. Leach Albert J., Monien B., Rodriguez Artalejo M. Proc. ICALP'91. Lecture Notes in Computer Science. Vol. 510:1991;217-228 Springer, Berlin.