A theory of normed simulations

ACM Transactions on Computational Logic

Volumn 5, Issue 4, 2004, Pages 577-610

  Griffigen, David ^a   Vaandrager, Frits ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Automata; Backward simulations; Computer aided verification; Forward simulations; History variables; Normed simulations; Prophecy variables; Refinement mappings

Indexed keywords

BACKWARD SIMULATION; COMPUTER-AIDED VERIFICATION; FORWARD SIMULATION; REFINEMENT MAPPINGS;

COMPUTER AIDED LOGIC DESIGN; COMPUTER SIMULATION; FORMAL LOGIC; FUNCTIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS;

AUTOMATA THEORY;

EID: 8344271210     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/1024922.1024923     Document Type: Article

References (47)

1. ABADI, M. AND LAMPORT, L. 1991. The existence of refinement mapping. Theor. Comput. Sci. 82, 2, 253-284.
2. ARIOLA, Z. AND KLOP, J. 1996. Equational term graph, rewriting. Fundamenta Informaticae 26, 3/4, 207-240. Extended version published as Tech. rep. CIS-TR-95-16, University of Oregon, Eugene, OR.
3. BAIER, C. AND STOELINGA, M. 2000. Norm functions for probabilistic bisimulations with delays. In Proceedings of 3rd International Conference on Foundations of Science and Computation Structures (FOSSACS) (Berlin, Germany, March 2000), J. Tiuryn, Ed. Lecture Notes in Computer Science, vol. 1784. Springer-Verlag, Berlin, Germany, 1-16.
4. BASTEN, T. 1996. Branching bisimilarity is an equivalence indeed! Inform. Process. Lett. 58, 3, 141-147.
5. BENSALEM, S., GANESH, V., LAKHNECH, Y., NOZ, C. M., OWRE, S., RUEß, H., RUSHBY, J., RUSU, V., SAÏDI, H., SHANKAR, N., SINGERMAN, E., AND TIWARI, A. 2000. An overview of SAL. In LFM 20: Fifth NASA Langley Formal Methods Workshop, C. M. Holloway, Ed. NASA Langley Research Center, Hampton, VA, 187-196.
6. BENSALEM, S., LAKHNECH, Y., AND SAIDI, H. 1996. Powerful techniques for the automatic generation of invariants. In Proceedings of the 8th International Conference on Computer Aided Verification (New Brunswick, NJ), R. Alur and T. Henzinger. Eds. Lecture Notes in Computer Science, vol. 1102. Springer-Verlag, Berlin, Germany, 323-335.
7. BEOWNE, M., CLARKE, E., AND GRÜMBERG, O. 1988. Characterizing finite Kripke structures in prepositional temporal logic. Theor. Comput. Sci. 59, 1,2, 115-131.
8. DE NICOLA, R. AND VAANDRAGER, F. 1995. Three logics for branching bisimulation. J. Assoc. Comput. Mach. 42, 2 (Mar.), 458-487.
9. DEVILLERS, M., GRIFFIOEN, W., AND MÜLLER, O. 1997. Possibly infinite sequences: A comparative case study. In 10th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'97), E. Gunter and A. Felty, Eds. Lecture Notes in Computer Science, vol. 1275. Springer-Verlag, Berlin, Germany, 89-104.
10. DEVILLERS, M., GRIFFIOEN, W., ROMLIN, J., AND VAANDRAGER, F. 2000. Verification of a leader election protocol: Formal methods applied to IEEE, 1394. Form. Meth. Syst. Des. 16, 3 (June), 307-320.
11. GARLAND, S., LYNCH. N., AND VAZRI, M. 1997. IOA: A language for specifiying, programming, and validating distributed systems. Available through URL http://larch.lcs.mit. edu:8001/~garland/ioaLangnage.html.
12. GAWLICK, R., SEGALA, E., SØGAARD-ANDERSEN, J., AND LYNCH, N. 1993. Liveness in timed and untimed systems. Tech. rep. MIT/LCS/TR-587. Laboratory for Computer Science, MIT, Cambridge, MA.
13. GINZBURG. A. 1968. Algebraic Theory of Automata. Academic Press, New York, NY, and London, U.K
14. GLABBBEK, R. VAN AND WEIJLAND, W. 1996. Branching time and abstraction in bisimulation semantics. J. Assoc. Comp. Mach. 43, 3, 555-600.
15. GRIFFIOEN, W. 2000. Studies in computer aided verification of protocols. Ph.D. dissertation. University of Nijmegen, Nijniegen, The Netheriands. Postscript and PVS sources available via http://www.cs.kun.nl/ita/former- members/davidg/.
16. GRIFFIOEN, W. AND VAANDRAGER, F. 1998. Normed simulations. In Proceedings of the 10th International Conference on Computer Aided Verification (Vancouver, BC, Canada), A. Hu and M. Vardi, Eds. Lecture Notes in Computer Science, vol. 1427. Springer-Verlag, Berlin, Germany, 332-344.
17. GROOTE, J. AND SPRINGINTVELD, J. 1995. Focus points and convergent process operators - a proof strategy for protocol verification. Report CS-R9566, Department of Software Technology, CWI, Amsterdam, The Netherlands.
18. GUTTAG, J. AND HORNING, J. 1993. Larch: Languages and Tools for Formal Specification. Springer-Verlag, Berlin, Germany.
19. HELMINK, L., SELLINK, M., AND VAANDRAGER, F. 1994. Proof-checking a data link protocol. In Proceedings of the International Workshop TYPES'93 (Nijmegen, The Netherlands, May 1993), H. Barendregt and T. Nipkow, Eds. Lecture Notes in Computer Science, vol. 806. Springer-Verlag, Berlin, Germany, 127-165.
20. JONSSON, B. 1985. A model and proof system for asynchronous networks. In Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing (Minaki, Ontario, Canada). 49-58.
21. JONSSON, B. 1987. Compositional verification of distributed systems. Ph.D. dissertation, Department of Computer Systems, Uppsala University, Uppsala, Sweden. DoCS 87/09.
22. JONSSON, B. 1990. On decomposing and refining specifications of distributed systems. In Proceedings of the REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness (Mook, The Netherlands, May/June 1989), J. de Bakker, W. d. Roever, and G. Rozenberg, Eds. Lecture Notes in Computer Science, vol. 430. Springer-Verlag, Berlin, Germany, 361-387.
23. JONSSON, B. 1991. Simulations between specifications of distributed systems. In Proceedings of CONCUR 91 (Amsterdam, The Netherlands), J. Baeten and J. Groote, Eds. Lecture Notes in Computer Science, vol. 527. Springer-Verlag, Berlin, Germany, 346-360.
24. JONSSON, B. 1994. Compositional specification and verification of distributed systems. ACM Trans. Program. Lang. Syst. 16, 2 (Mar.), 259-303.
25. KLARLUND, N. AND SCHNEIDER, F. 1989. Verifying safety properties using infinite-state automata. Tech. rep. 89-1039. Department of Computer Science, Cornell University, Ithaca, NY.
26. KLARLUND, N. AND SCHNEIDER, F. 1993. Proving nondeterministically specified safety properties using progress measures. Inf Computat. 107, 1 (Nov.), 151-170.
27. KNUTH, D. 1997. Fundamental Algorithms, 3rd ed. The Art of Computer Programming, vol. 1. Addison-Wesley, Reading, MA.
28. LAKHNECH, Y., BENSALEM, S., BEREZIN, S., AND OWRE, S. 2001. Incremental verification by abstraction. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Genoa, Italy), T. Margaria and W. Yi, Eds. Lecture Notes in Computer Science, vol. 2031. Springer-Verlag, Berlin, Germany.
29. LAMPORT, L. 1983. What good is temporal logic? In Information Processing 83, R. Mason, Ed. North-Holland, Amsterdam, The Netherlands, 657-668.
30. LYNCH, N. 1996. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Fransisco, CA.
31. LYNCH, N. AND TUTTLE, M. 1987. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing. 137-151. A full version is available as Tech. rep. MIT/LCS/TR-387, MIT, Cambridge, MA.
32. LYNCH, N. AND VAANDRAGER, F. 1995. Forward and backward simulations, I: Untimed systems. Inf. Computat. 121, 2 (Sept.), 214-233.
33. LYNCH, N. AND VAANDRAGER, F. 1996. Forward and backward simulations, II: Timing-based systems. Inf. Computat. 128, 1 (July), 1-25.
34. MANNA, Z., BROWNE, A., SIPMA, H., AND URIBE, T. 1998. Visual abstraction for temporal verification. In Proceedings AMAST'98, A. Haeberer, Ed. Lecture Notes in Computer Science, vol. 1548. Springer-Verlag, Berlin, Germany, 28-41.
35. MILNER, R. 1971. An algebraic definition of simulation between programs. In Proceedings of the 2nd Joint Conference on Artificial Intelligence. British Computer Society Press, London, U.K., 481-489. Also available as Report No. CS-205, Computer Science Department, Stanford University, Stanford, CA.
36. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall International, Engiewood Cliffe, NJ.
37. MUELLER, O. 1998. A verification environnient for I/O automata based on formalized meta-theory. Ph.D. dissertation. Technical University of Munich, Munich, Germany.
38. NAMJOSHI, K. 1997. A simple characterization of stuttering bisimulation. In Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (Kharagpur, India) S. Ramesh and G. Sivakumar, Eds. Lecture Notes in Computer Science, vol. 1346. Springer-Verlag, Berlin, Germany, 284-296.
39. NIPKOW, T. AND SLIND, K. 1995. I/O automata in Isabelle/HOL. In Types for Proofs and Programs, P. Dybjer, B. Nordström, and J. Smith, Eds. Lecture Notes in Computer Science, vol. 996. Springer-Verlag, Berlin, Germany, 101-119.
40. OWICKI, S. AND GRIES, D. 1976. An axiomatic proof technique for parallel programs. Acta Inf. 6, 4, 319-340.
41. OWRE, S., RUSHBY, J., SHANKAR, N., AND HENKE, F. v. 1995. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVB. IEEE Trans. Softw. Eng. 21, 2 (Feb.), 107-125.
42. ROEVER, W. DE. AND ENGELHARDT; K. 1998. Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge Tracts in Theoretical Computer Science 47. Cambridge Univrersity Press, Cambridge, UK.
43. SISTLA, A. 1991. Proving correctness with respect to nondeterministic safety specifications. Inf. Process. Lett. 39, 1 (July), 45-49.
44. SØGAARD-ANDERSEN, J., GARLAND, S., GUTTAG, J., LYNCH, N., AND POGOSYANTS, A 1993a. Computer-assisted simulation proofe. In Proceedings of the 5th International Conference on Computer Aided Verification (Elounda, Greece), C. Courcoubetis, Ed. Lecture Notes in Computer Science, vol. 697. Springer-Verlag, Berlin, Germany, 305-319.
45. SØGAARD-ANDERSEN, J., LYNCH, N., AND LAMPSON, B. 1993b. Correctness of communication protocols - a case study. Tech. rep. MIT/LCS/TH-589. Laboratory for Computer Science, MIT, Cambridge, MA.
46. STARK, E. 1988. Proving entailment between conceptual state specifications. Thear. Comput. Sci. 56, 135-154.
47. WOLPER, P. 1997. The meaning of formal: from weak to strong formal methods. Springer Int. J. Softw. Tools Tech. Trans. 1, 1-2, 6-8.