Verifying safety properties of a class of infinite-state distributed algorithms

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

Volumn 939, Issue , 1995, Pages 42-53

  Jonsson, Bengt ^a   Kempe, Lars ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

TELEPHONE SETS;

AUTOMATED VERIFICATION; CORRECTNESS PROPERTIES; INFINITE STATE; INITIAL STATE; MODEL SPECIFICATIONS; REACHABILITY PROBLEM; SAFETY PROPERTY; TELEPHONE SERVICES;

COMPUTER AIDED ANALYSIS;

EID: 21844518287     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60045-0_39     Document Type: Conference Paper

References (19)

1. th IEEE Int. Symp. on Logic in Computer Science, 1993. Accepted for Publication in Information and Computation.
2. P. A. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. In Abiteboul and Shamir, editors, Proc. ICALP '94, volume 820 of Lecture Notes in Computer Science, pages 316-327. Springer Verlag, 1994.
3. th IEEE Int. Symp. on Logic in Computer Science, pages 414-425, Philadelphia, 1990.
4. th IEEE Real-Time Systems Symposium, pages 2-11, 1993.
5. M. Ben-Ari. Mathematical Logic for Computer Science. Prentice Hall, 1993.
6. J. Blom, B. Jonsson, and L, Kempe. Using temporal logic for modular specification of telephone services. In Feature Interactions in Telecommunications Systems, Amsterdam, Holland, May 1994.
7. T. Bowen, F. Dworack, C. Chow, N. Griffeth, G. Herman, and Y.-J. Lin. The feature interaction problem in telecommunications system. SETS, 1989.
8. O. Burkart and B. Steffen. Model checking for context-free processes. In Cleaveland, editor, Proc. CONCUR '92, Theories of Concurrency: Unification and Extension, number 630 in Lecture Notes in Computer Science, pages 123-137. Springer Verlag, 1992.
9. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. In Proc. CONCUR '93, Theories of Concurrency: Unification and Extension, pages 143-157, 1993.
10. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In W. R. Cleaveland, editor, Proc. CONCUR '92, Theories of Concurrency: Unification and Extension, pages 138-147, 1992.
11. th ACM Symp. on Principles of Distributed Computing, Vancouver, Canada, pages 294-303, 1987.
12. M. Fischer and R. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, 18:194-211, 1979.
13. S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, 1992.
14. P. Jančar. Decidability of a temporal logic problem for petri nets. Theoretical Computer Science, 74:71-93, 1990.
15. B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of nonfinite-state programs. Information and Computation, 107(2):272-302, Dec. 1993.
16. F. J. Lin and Y.-J. Lin. A building block approach to detecting and resolving feature interactions. In L. Bouma and H. Velthuijsen, editors, Feature Interactions in Telecommuniactions Systems, pages 86-119. IOS Press, 1994.
17. Z. Shtadler and O. Grumberg. Network grammars, communication behaviours and automatic verification. In Sifakis, editor, Proc. Workshop on Computer Aided Verification, volume 407 of Lecture Notes in Computer Science, pages 151-165. Springer Verlag, 1990.
18. K. Čerāns. Decidability of bisimulation equivalence for parallel timer processes. In Proc. Workshop on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science, pages 302-315, 1992.
19. th ACM Symp. on Principles of Programming Languages, pages 184-193, Jan. 1986.