Verification and behavior abstraction towards a tractable verification technique for large distributed systems

Journal of Systems and Software

Volumn 33, Issue 3 SPEC. ISS., 1996, Pages 273-285

  Nitsche, Ulrich ^a  

^a FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; LARGE SCALE SYSTEMS; SPECIFICATIONS; STATE SPACE METHODS;

BEHAVIOR ABSTRACTION; LARGE DISTRIBUTED SYSTEMS; PARTIAL ORDER SEMANTICS; VERIFICATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0030173961     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/0164-1212(96)00026-X     Document Type: Article

References (35)

1. Alpern, B., and Schneider, F. B., Defining Liveness, Information Processing Letters, 21(4):181-185 (October 1985).
2. Budkowski, S., and Dembinski, P., An Introduction to Estelle, Computer Networks and ISDN-Systems, 14:3-23 (1987).
3. Berstel, J., Transductions and Context-Free Languages, Studienbücher Informatik, Teubner-Verlag, Stuttgart, first edition, 1979.
4. Best, E., ed. CONCUR'93 Lecture Notes in Computer Science, vol. 715, Springer-Verlag, 1993.
5. Burkhardt, H. J., Ochsenschläger, P., and Prinoth, R. Product Nets - a Formal Description Technique for Cooperating Systems, GMD-Studien 165, Gesellschaft für Mathematik und Datenverarbeitung (GMD), Darmstadt, September 1989.
6. Bruns, G., A practical technique for process abstraction, in Best (1993), pp. 37-49.
7. Büchi, J. R., On a decision method in restricted second order arithmetic, Proceedings of the International Congress on Logic, Methodology and Philosophy of Science 1960, (E. Nagel et al., ed.), Stanford University Press, 1962, pp. 1-11.
8. Clarke, E. M., and Emerson, E. A., Design and synthesis of synchronization skeletons using branching-time temporal logic, in Logic of programs 1981, (Dexter Kozen, ed.), Lecture Notes in Computer Science, volume 131, Springer-Verlag, 1982, pp. 52-71.
9. Clarke, E. M., Emerson, E. A., and Sistla, A. P., Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, ACM Transactions on Programming Languages and Systems, 8(2):244-263 (1986).
10. Combes, P., Michel, M., and Renard, B., Formal verification of telecommunication service interactions using SDL methods and tools, in SDL'93: Using Objects, (O. Faergemand and A. Sarma, eds.), Elsevier, 1993, pp. 441-452.
11. Desel, J., Oberweis, A., and Reisig, W., eds. Workshop: Algorithmen und Werkzeuge für Petrinetze, Humboldt Universität Berlin, 1994.
12. Emerson, E. A., Temporal and modal logic, in Formal Models and Semantics, (J. van Leeuwen ed.) Elsevier Science Inc., New York, 1990.
13. Graf, S., and Loiseaux, C., Property preserving abstractions under parallel composition, TAPSOFT'93, Lecture Notes in Computer Science, volume 668, Springer-Verlag, 1993, pp. 644-657.
14. Godefroid, P., and Wolper, P., A Partial Approach to Model Checking, in 6th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1991, pp. 406-415.
15. Godefroid, P., and Wolper, P., Using partial orders for the efficient verification of deadlock freedom and safety properties, in K. G. Larsen and A. Skou, eds., CAV'91 - Computer Aided Verification 1991, Lecture Notes in Computer Science, volume 575, (K. G. Lasen and A. Skovs, eds.), Springer-Verlag, 1992, pp. 332-342.
16. Godefroid, P., and Wolper, P., Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties, Formal Methods in System Design, 2(2):149-164 (April 1993).
17. Harrison, M. A., Introduction to Formal Language Theory, Addison-Wesley, Reading, Massachusetts, first edition, 1978.
18. Hoogeboom, H. J., and Rozenberg, G., Infinitary languages: Basic theory and applications to concurrent systems, in Current trends in concurrency, in Lecture Notes in Computer Science, volume 224, (J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, eds.), Springer-Verlag, 1986, pp. 266-342.
19. Hopcroft, J. E., and Ullman, J. D., Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, Massachusetts, first edition, 1979.
20. Nitsche, U., Prepositional linear temporal logic and language homomorphism, in Logical Foundations of Computer Science '94 - Logic at St. Petersburg, Lecture Notes in Computer Science, volume 813, (Anil Nerode and Yuri V. Matiyasevich, eds.), Springer-Verlag, 1994, pp. 265-277.
21. Nitsche, U., Simple Homomorphisms and Linear Temporal Logic, Arbeitspapiere der GMD 889, Gesellschaft für Mathematik und Datenverarbeitung (GMD), Darmstadt, December 1994.
22. Nitsche, U., A Verification Method Based on Homomorphic Model Abstraction, in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, ACM Press, Los Angeles, 1994, p. 393.
23. Nitsche, U., Verifying temporal logic formulas in abstractions of large reachability graphs, in Algorithmen und Werkzeuge für Petrinetze, (J. Desel, A. Oberweis, and W. Reisig, eds.). Humboldt Universität Berlin, Berlin, 1994.
24. Nitsche, U., A Finitary Language Semantics for Propositional Linear Temporal Logic (abstract), in Preproceedings of the 2nd International Conference on Developments in Language Theory, University of Magdeburg, 1995. The complete version of this paper will be published 1996 in the conference's proceedings by World Scientific, Singapore.
25. Ochsenschläger, P., Die Produktnetzmaschine, Petri Net Newsletter, 39:11-31 (August 1991). Also appeared as a GMD Arbeitspapier Nr. 505, 1991.
26. Ochsenschläger, P., Verifikation kooperierender Systeme mittels schlichter Homomorphismen. Arbeitspapiere der GMD 688, Gesellschaft für Mathematik und Datenverarbeitung (GMD), Darmstadt, Oktober 1992.
27. Ochsenschläger, P., Kompositionelle Verifikation kooperierender Systeme. Arbeitspapiere der GMD 885, Gesellschaft für Mathematik und Datenverarbeitung (GMD), Darmstadt, Dezember, 1994.
28. Ochsenschläger, P., Verification of cooperating systems by simple homomorphisms using the product net machine, in Algorithmen und Werkzeuge für Petrinetze, (J. Desel, A. Oberweis, and W. Reisig, eds.). Humboldt Universität Berlin, Berlin, 1994.
29. Sifakis, J., Property preserving homomorphisms of transition systems, in Logics of programs, in Lecture Notes in Computer Science, volume 164, (Edmund Clarke and Dexter Kozen, eds.) Springer-Verlag, 1983, pp. 458-473.
30. Saracco, R., Smith, J. R. W., and Reed, R., Telecommunication Systems' Engineering Using SDL, North-Holland, 1989.
31. Thomas, W., Automata on infinite objects, in Formal Models and Semantics, (J. van Leeuwen, ed.). Elsevier Science, Inc., 1990.
32. Valmari, A., A stubborn attack on state explosion, in CAV'90 - Computer Aided Verification 1990, Lecture Notes in Computer Science, volume 531, (E. M. Clarke and R. P. Kurshan, eds.), Springer-Verlag, 1991, pp. 156-165.
33. Valmari, A., Stubborn sets for reduced state space generation, in Advances in Petri Nets 1990, Lecture Notes in Computer Science, volume 483, (Grzegorz Rozenberg, ed.), Springer-Verlag, 1991, pp. 491-515.
34. van Leeuwen, J., ed., Formal models on semantics, in Handbook of Theoretical Computer Science, volume B, Elsevier, 1990.
35. Wolper, P., and Godefroid, P., Partial-order methods for temporal verification, in Concur '93, (E. Best, ed.), Springer-Verlag, Berlin, 1993.