Improved verification of linear-time properties within fairness: Weakly continuation-closed behaviour abstractions computed from trace reductions

Software Testing Verification and Reliability

Volumn 13, Issue 4, 2003, Pages 241-255

  Ultes Nitsche, Ulrich ^a   St James, Simon ^b  

^a UNIVERSITY OF FRIBOURG   (Switzerland)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Persistent set selective search; Satisfaction within fairness; Trace reduction; Weakly continuation closed behaviour abstraction

Indexed keywords

ALGORITHMS; AUTOMATION; CONSTRAINT THEORY; DISTRIBUTED COMPUTER SYSTEMS; STATE SPACE METHODS;

SELECTIVE SEARCH; TRACE REDUCTION;

ABSTRACTING;

EID: 0346884001     PISSN: 09600833     EISSN: None     Source Type: Journal    
DOI: 10.1002/stvr.280     Document Type: Conference Paper

References (35)

1. Nitsche U, Wolper P. Relative liveness and behavior abstraction (extended abstract). Proceedings of the 16th ACM Symposium on Principles of Distributed Computing (PODC'97), Santa Barbara, CA, 1997. ACM Press: New York, 1997; 45-52.
2. Nitsche U. Application of formal verification and behaviour abstraction to the service interaction problem in intelligent networks. Journal of Systems and Software 1998; 40(3):227-248.
3. Nitsche U, Ochsenschläger P. Approximately satisfied properties of systems and simple language homomorphisms. Information Processing Letters 1996; 60(4):201-206.
4. Ultes-Nitsche U. Satisfaction up to liveness - automatic verification based on exhaustive testing. Proceedings of the IFIP TC6/WG6.1 International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing and Verification (FORTE/PSTV2000), Pisa, Italy, 2000. Kluwer: Boston, MA, 2000; 237-248.
5. Alur R, Henzinger TA. Local liveness for compositional modeling of fair reactive systems. Computer Aided Verification (CAV) '95 (Lecture Notes in Computer Science, vol. 939), Wolper P (ed.). Springer: Berlin, 1995; 166-179.
6. Henzinger TA. Sooner is safer than later. Information Processing Letters 1992; 43(3):135-141.
7. Abadi M, Lamport L. The existence of refinement mappings. SAC Report 29, DEC Systems Research Center, Palo Alto, CA, 1988.
8. Abadi M, Lamport L. Composing specifications. SRC Report 66, DEC Systems Research Center, Palo Alto, CA, 1990.
9. Vardi MY, Wolper P. Reasoning about infinite computations. Information and Computation 1994; 115(1):1-37.
10. Wolper P. On the relation of programs and computations to models of temporal logic. Proceedings of Temporal Logic in Specification (Lecture Notes in Computer Science, vol. 398), Banieqbal B, Barringer H, Pnueli A (eds.). Springer: Berlin, 1989; 75-123.
11. Peled DA, Pratt VR, Holzmann GJ (eds.). Partial Order Methods in Verification (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol. 29). American Mathematical Society, 1997.
12. Godefroid P, Wolper P. Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Methods in System Design 1993; 2(2):149-164.
13. Wolper P, Godefroid P. Partial-order methods for temporal verification. CONCUR'93 (Lecture Notes in Computer Science, vol. 715), Best E (ed.). Springer: Berlin, 1993; 233-246.
14. Godefroid P. Using partial-orders to improve automatic verification methods. Computer Aided Verification (CAV) '90, New Brunswick, 1991 (Lecture Notes in Computer Science, vol. 531), Clarke EM, Kurshan RP (eds.). Springer, 1991; 176-185.
15. Godefroid P. Partial-order methods for the verification of concurrent systems - an approach to the state-explosion problem. PhD Thesis, Université de Liège, Liège, Belgium, 1995.
16. Diekert V, Rozenberg G (eds.). The Book of Traces (1st edn). World Scientific: Singapore, 1995.
17. Mazurkiewicz A. Trace theory. Petri Nets: Application and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II; Proceedings of an Advanced Course (Lecture Notes in Computer Science, vol. 255). Springer: Berlin, 1986; 279-324.
18. Francez N. Fairness (1st edn). Springer: New York, 1986.
19. Eilenberg S. Automata, Languages and Machines, vol. A. Academic Press: New York, 1974.
20. Thomas W. Automata on infinite objects. Formal Models and Semantics (Handbook of Theoretical Computer Science, vol. B), van Leeuwen J (ed.). Elsevier: Amsterdam, 1990; 133-191.
21. Alpern B, Schneider FB. Defining liveness. Information Processing Letters 1985; 21(4):181-185.
22. Nitsche U. Verification of Co-Operating Systems and Behaviour Abstraction (GMD Research Series, vol. 7). GMD: Sankt Augustin, Germany, 1998.
23. Bruns G. A practical technique for process abstraction. CONCUR'93 (Lecture Notes in Computer Science, vol. 715), Best E (ed.). Springer: Berlin, 1993; 37-49.
24. Clarke EM, Grumberg O, Long DE. Model checking and abstraction. Proceedings of the 19th ACM Symposium on Principles of Programming Languages, Albuquerque. ACM Press: New York, 1992.
25. Graf S, Loiseaux C. Property preserving abstractions under parallel composition. TAPSOFT'93 (Lecture Notes in Computer Science, vol. 668). Springer: Berlin, 1993; 644-657.
26. Kurshan RP. Computer-Aided Verification of Coordinating Processes (1st edn). Princeton University Press: Princeton, NJ, 1994.
27. Nitsche U. Prepositional linear temporal logic and language homomorphisms. Proceedings of the 3rd International Symposium on Logical Foundations of Computer Science (LFCS'94), St Petersburg (Lecture Notes in Computer Science, vol. 813), Nerode A, Matiyasevich YV (eds.). Springer, 1994; 265-277.
28. Sifakis J. Property preserving homomorphisms of transition systems. Logics of Programs (Lecture Notes in Computer Science, vol. 164), Clarke E, Kozen D (eds.). Springer: Berlin, 1983; 458-473.
29. Ochsenschläger P. Verifikation kooperierender Systeme mittels schlichter Homomorphismen. Arbeitspapiere der GMD 688, Gesellschaft für Mathematik und Datenverarbeitung (GMD), Darmstadt, 1992.
30. Ochsenschläger P. Verification of cooperating systems by simple homomorphisms using the product net machine. Workshop: Algorithmen und Werkzeuge für Petrinetze, Desel J, Oberweis A, Reisig W (eds.). Humboldt Universität Berlin, 1994; 48-53.
31. St James S, Ultes-Nitsche U. Computing property-preserving behaviour abstractions from trace reductions. Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC 2001). ACM Press: New York, 2001; 238-245.
32. Peterson JL. Petri Net Theory and the Modeling of Systems (1st edn). Prentice-Hall, 1981.
33. Valmari A. A stubborn attack on state explosion. CAV'90 - Computer Aided Verification 1990 (Lecture Notes in Computer Science, vol. 531), Clarke EM, Kurshan RP (eds.). Springer: Berlin, 1991; 156-165.
34. Valmari A. Stubborn sets for reduced state space generation. Advances in Petri Nets 1990 (Lecture Notes in Computer Science, vol. 483), Rozenberg G (ed.). Springer: Berlin, 1991; 491-515.
35. Holzmann GJ. The model checker SPIN. IEEE Transactions on Software Engineering 1997; 23(5):279-295. Special issue on Formal Methods in Software Practice.