A compositional theory of refinement for branching time

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

Volumn 2860, Issue , 2003, Pages 304-318

  Manolios, Panagiotis ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BRANCHING TIME; COMPOSITIONAL THEORY; LINEAR TIME; MACHINE CLOSURES; MECHANICAL VERIFICATION; NON-DETERMINISM; PROPHECY VARIABLES; REFINEMENT MAPS;

DESIGN;

EID: 0142152291     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39724-3_28     Document Type: Article

References (26)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253-284, 1991.
2. P. C. Attie. Liveness-preserving simulation relations. In ACM Symposium on the Principles of Distributed Computing (PODC), pages 63-72, May 1999.
3. T. Basten. Branching bisimilarity is an equivalence indeed. Information Processing Letters, 58(3):141-147, 1996.
4. J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In Computer-Aided Verification (CAV '94), vol. 818 of LNCS, pages 68-80. Springer-Verlag, 1994.
5. K. Engelhardt and W.-P. de Roever. Generalizing Abadi & Lamport's method to solve a problem posed by A. Pnueli. In FME '93: Industrial-Strength Formal Methods, vol. 670 of LNCS, pages 294-313. Springer-Verlag, 1993.
6. R. J. v. Glabbeek. The linear time - branching time spectrum I; the semantics of concrete, sequential processes. In Handbook of Process Algebra, chapter 1, pages 3-99. Elsevier, 2001.
7. M. R. Henzinger, T. A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. In IEEE Symposium on Foundations of Computer Science, pages 453-462. IEEE Computer Society Press, 1995.
8. W. Hesselink. Eternity variables to simulate specifications. In Proceedings Mathematics of Program Construction, Dagstuhl, 2002, vol. 2386 of LNCS, pages 117-130. Springer-Verlag, 2002.
9. B. Jonsson, A. Pnueli, and C. Rump. Proving refinement using transduction. Distributed Computing, 12(2-3):129-149, 1999.
10. M. Kaufmann, P. Manolios, and J. S. Moore, editors. Computer-Aided Reasoning: ACL2 Case Studies. Kluwer Academic Publishers, June 2000.
11. M. Kaufmann, P. Manolios, and J. S. Moore. Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, July 2000.
12. M. Kaufmann and J. S. Moore. ACL2 homepage. See URL http://www.cs.-utexas.edu/users/moore/acl2.
13. K. Kunen. Set Theory - An Introduction to Independence Proofs, vol. 102 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1980.
14. L. Lamport. What good is temporal logic? Information Processing, 83:657-688, 1983.
15. N. A. Lynch and F. W. Vaandrager. Forward and backward simulations - part I: untimed systems. Information and Computation, 121(2):214-233, 1995.
16. P. Manolios. Correctness of pipelined machines. In Formal Methods in Computer-Aided Design-FMCAD 2000, vol. 1954 of LNCS, pages 161-178. Springer-Verlag, 2000.
17. P. Manolios, K. Namjoshi, and R. Sumners. Linking theorem proving and model-checking with well-founded bisimulation. In Computer-Aided Verification-CAV '99, vol. 1633 of LNCS, pages 369-379. Springer-Verlag, 1999.
18. R. Milner. Communication and Concurrency. Prentice-Hall, 1990.
19. K. S. Namjoshi. A simple characterization of stuttering bisimulation. In 17th Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 1346 of LNCS, pages 284-296, 1997.
20. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
21. D. Park. Concurrency and automata on infinite sequences. In Theoretical Computer Science, vol. 104 of LNCS, pages 167-183. Springer-Verlag, 1981.
22. A. Pnueli. The temporal logic of programs. In 18th Annual Symposium on Foundations of Computer Science, pages 46-57, Providence, Rhode Island, 1977. IEEE.
23. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In Proceedings of 12th International Colloquium on Automata, Languages and Programming, vol. 194 of LNCS, pages 15-32. Springer-Verlag, 1985.
24. J. Sawada. Formal Verification of an Advanced Pipelined Machine. PhD thesis, University of Texas at Austin, Dec. 1999.
25. J. Sawada. Verification of a simple pipelined machine model. In Kaufmann et al. [10], pages 137-150.
26. L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time. In STOC: ACM Symposium on Theory of Computing (STOC), pages 1-9, 1973.