Three Logics for Branching Bisimulation

Journal of the ACM (JACM)

Volumn 42, Issue 2, 1995, Pages 458-487

  Nicola, Rocco De ^a   Vaandrager, Frits ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; COMPUTER SYSTEMS; EQUIVALENCE CLASSES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS;

BACKWARD MODALITIES; BRANCHING BISIMULATION; DOUBLY LABELED TRANSITION SYSTEMS; LABELED TRANSITION SYSTEMS; REACTIVE SYSTEMS; SEMANTICS; TEMPORAL LOGICS;

FORMAL LOGIC;

EID: 0029272304     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/201019.201032     Document Type: Article

References (39)

1. Abramsky, S. 1989. Observation equivalence as a testing equivalence. Theoret. Comput. Sci. 53, 225-241.
2. Akkerman, G. J., and baeten, J. C. M. 1990. Term rewriting analysis in process algebra. Report p. Programming Research Group, Univ. Amsterdam, Amsterdam, the Netherlands.
3. Baeten, J.C.M. 1990. Applications of process algebra. Cambridge Tract in Theoretical Computer Science, Vol. 17. Cambridge University Press, Cambridge, England.
4. Baeten, J. C. M., and weijland, W. P. 1990, Process Algebra. Cambridge Tract in Theoretical Computec Science, Vol, 18. Cambridge University Press, Cambridge England.
5. Bloom, B., Istrail, S., And Meyer, A. R. 1988/1990. Bisimulation can't be traced; Preliminary report. In Conference Record of the 15th ACM Symposium on Principles of Programming Languages (POPL) (San Diego, Calif.), ACM, New York, pp. 229-239. Full version appeared as Tech. Rep. TR 90-1150, Cornell Univ., Ithaca, N.Y., 1990.
6. Bolognesi, T., van de langmaat, J. and vissers, C. 1995. Lotosphere: software development with LOTUS, Kluver Dordrect.
7. Browne, M. C., clarke, E. M., and grumberg, O. 1988. Characterizing finite Kripke structures in propositional temporal logic. Theoret. Comput. Sci. 59, 1, 2, 115-131.
8. Clarke, E. M., emerson, E. A., and sistla, A. P. 1986. Automatic verification of finite state concurrent systems using temporal logic specifications. ACM Trans. Prog. Lang. Syst. 8, 2 (Apr.), 244-263.
9. Clarke, E. M., long, D. £., and macmillan, K. L. 1989. Compositional model checking. In Proceedings of the 4th Annual Symposium on Logic in Computer Science (L1CS) (Asilomar, Calif.). IEEE Computer Society Press, Washington, D.C., pp. 353-362.
10. Cleaveland, R., Parrow, J., And Steffen, B. 1990. The concurrency workbench. In Automatic Verification Methods for Finite State Systems J. Sifakis, ed. Lecture Notes in Computer Science, vol. 407. Springer-Verlag, New York, pp. 24-37.
11. Darondeau, ph., and degano, P. 1991. About semantic action refinement. Fund. Inf. XIV, 2, 221-234.
12. De barker, J„ de roever, W. P., and rozenberg, G. eds. 1989. Linear time, branching time and partial order in logics and models for concurrency. In Lecture Notes in Computer Science, vol. 354, Springer-Verlag, New York.
13. De nicola, R. 1987. Extensional equivalences for transition systems. Acta Inf. 24, 211-237.
14. De nicola, R., Fantechi, A., Gnesi, S., And Ristori, G. 1993. An action-based framework for verifying logical and behavioral properties of concurrent systems. Comput. Netw. and ISDN Syst. 25, 761-778.
15. De nicola, R., Inverardi, P., and Nesi, M. 1990. Using axiomatic presentation of behavioural equivalences for manipulating CCS specifications. In Automatic Verification Methods for Finite State Systems (Sifakis, ed.). Lecture Notes m Computer Science, Vol. 407. Springer-Verlag, New York, pp. 54-67.
16. De nicola, R., montanari, U„ and vaandrager, F. W. 1990. Back and Forth Bisimulations. In CONCUR '90, J. Baeten, and J. W. Klop, eds. Lecture Notes in Computer Science, vol. 458. Springer-Verlag, New York, pp. 152-165.
17. De nicola, R., and vaandrager, F. W. 1990. Action versus state based logics for transition systems. In Semantics of Concurrency, I. Guessanan, ed. Lecture Notes in Computer Science, vol. 469. Springer-Verlag, New York, pp. 407-419.
18. De nicola, R., and vaandrager, F. W. 1990. Three logics for branching bisimulation (Extended Abstract). In Proceedings of the 5th Annual Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, New York, pp. 118-129.
19. Emerson, E. A., and halpern, J. Y. 1986. “Sometimes” and “Not Never” Revisited; On branching versus linear time temporal logic. J. ACM 33, 1 (Jan.) 151-178.
20. Emerson, E. A., and lei, C. L. 1984, Model checking under generalized fairness constraints. Technical Report TR-84-20, Dept, of Computer Sciences, University of Texas at Austin, Austin, Texas, June.
21. Emerson, E.A., and Srinivasan, J. 1989. Branching time temporal logic. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, J. de Bakker, W. P. de Roever, and G. Rozenberg, Eds Lecture Notes in Computer Science, vol. 354. Springer-Verlag, New York, pp. 123-172.
22. Groote, J. F., and vaandrager, F. W. 1990. An efficient algorithm for branching bisimulation and stuttering equivalence. In Proceedings of ICALP '90, M. S. Paterson, Ed. Lecture Notes in Computer Science, vol. 443. Springer-Verlag, New York, pp. 626-638. van glabbeek, R. J. 1990. Comparative concurrency semantics and refinement of actions. Ph.D. dissertation, Free University, Amsterdam, The Netherlands.
23. Van glabbeek, R. J., and weijland, W. P. 1989/1991. Branching time and abstraction in bisimulation semantics (extended abstract). In Information Processing '89, G. X. Ritter, ed. North Holland, Amsterdam, The Netherlands, pp. 613-618. Full paper appeared as CWI Report CS-R9120, Amsterdam 1991.
24. Van Glabbeek, R. J., and weijland, W. P. 1989. Refinement in branching time semantics. In Proceedings of the AMAST Conference. IOWA pp. 197-201.
25. Hennessy, M., and milner, R. 1985. Algebraic laws for nondeterminism and concurrency. /. ACM 32, 1 (Jan.). 137-161.
26. Hennessy, M., and stirling, C. 1985. The power of the future perfect in program logics. Inf. Control 67, 23-52.
27. Jonsson, B., Khan, A. H., And Parrow,J. 1990. Implementing a model checking algorithm by adapting existing automated tools. In Automatic Verification Methods for Finite State Systems (J. Sifakis, ed.). Lecture Notes in Computer Science, vol. 407, Springer-Verlag, New York, pp. 179-188.
28. Korver, H. 1992. Computing distinguishing formulae for branching bisimulation. In Proceedings of Computer Aided Verification, K. Larsen, and A. Skou, eds. Lecture Notes in Computer Science, vol. 575. Springer-Verlag, New York, pp. 13-23.
29. Koutny, m. 1991. Axiom system induced by CTL* logic, 1990. Fund. Inf. XIV 2, 235- 252.
30. Kozen, d. 1983. Results on the propositional mu-calculus. Theoret. Comput. Sci., 27, 333 - 354. laroussine, f., pinchinat, s., and schnoebelen, ph. 1995. Translation results for modal logics of reactive systems. Theoret Comput Set 140, 1, 53-71.
31. Lichtenstein, O., Pnueli, A., And Zuck, L. 1985. The glory of the past. In Proceedings of the Conference in Logics of Programs. Lecture Notes in Computer Science, vol. 193. Springer-Verlag, New York, pp. 196-218.
32. Milner, R. 1989. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, N.J.
33. Manna, Z., and pnueli, A. 1992. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, New York.
34. Park, D. M. R. 1989. Concurrency and automata on infinite sequences. In Proceedings of the 5ch GI Conference (P. Deussen, ed.). Lecture Notes in Computer Science, vol. 104. Springer-Verlag, New York, pp. 167-183.
35. Polak, E. E. 1992. An efficient implementation of branching bisimulation and distinguishing formulae. Master Thesis. Programming Research Group. Univ. Amsterdam, Amsterdam, The Netherlands.
36. Pratt, V. 1981. A decidable mu-calculus. In Proceedings of the 22nd Symposium on Foundations of Computer Science. IEEE Computer Society Press, New York, pp. 421-427.
37. Stirling, C. 1989. Temporal logics for CCS. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, J. de Bakker, W. P. de Roever, and G. Rozenberg, eds. Lecture Notes in Computer Science, vol. 354. Springer-Verlag, New York, pp. 660-672.
38. Stirling, C. 1992. Modal and temporal logics. In Handbook of Logic in Computer Science, vol. I (S. Abramsky, D. M. Gabbay and T. S. E. Maibaum, eds.) O. U. P., Oxford, pp. 477-563.
39. Street, R. S. 1982. Propositional dynamic logic of looping and converse is elementarily decidable. Inf. Cont. 54, 121-141.