Deciding and Axiomatizing Weak ST Bisimulation for a Process Algebra with Recursion and Action Refinement

ACM Transactions on Computational Logic

Volumn 3, Issue 4, 2002, Pages 465-520

  Bravetti, Mario ^a   Gorrieri, Roberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Languages; Theory

Indexed keywords

EID: 33645428345     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/566385.566386     Document Type: Article

References (39)

1. Aceto, L. 1994a. On “axiomatising finite concurrent processes”. SIAMJ. Comput. 23, 4, 852-863
2. Aceto, L. 1994b. A static view of localities. Form. Aspects Comput. 6, 201-222
3. Aceto, L. and Hennessy, M. 1993. Towards action refinement in process algebras. Inf. Comput. 103, 204-269
4. Aceto, L. and Hennessy, M. 1994. Adding action refinement to a finite process algebra. Inf. Comput. 115, 179-247
5. Baeten, J. C. M. and Weijland, W. P. 1990. Process Algebra. Cambridge University Press
6. Bergstra, J. A. and Klop, J. W. 1985. Algebra of communicating processes with abstraction. Theoret. Comput. Sci. 37, 1, 77-121
7. Boudol, G., Castellani, I., Hennessy, M., and Kiehn, A. 1994. A theory of processes with localities. Form. Aspects Comput. 6, 2, 165-200
8. Bravetti, M. 2002. Specification and analysis of stochastic real-time systems. Ph.D. dissertation. University of Bologna (Italy)
9. Bravetti, M., Bernardo, M., and Gorrieri, R. 1998. Towards performance evaluation with general distributions in process algebras. In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR ‘98) (Nice, France). Lecture Notes in Computer Science, vol. 1466. Springer-Verlag, New York, 405-422
10. Bravetti, M. and Gorrieri, R. 2002. The theory of interactive generalized semi-Markov processes. Theoret. Comput. Sci. 282, 1, 5-32
11. Busi, N., Van Glabbeek, R. J., and Gorrieri, R. 1994. Axiomatising st-bisimulation equivalence. In Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET'94) (S. Miniato, Italy). 169-188
12. Castellani, I. 1995. Observing distribution in processes: Static and dynamic localities. Int. J. Foundati. Comput. Sci. 6, 353-393
13. Darondeau, P. and Degano, P. 1989. Causal trees. In Automat, Lang. Prog. Lecture Notes in Computer Science, vol. 372. Springer-Verlag, New York, 234-248
14. Degano, P., Denicola, R., and Montanari, U. 1989. Partial ordering description of nondetermin-istic concurrent systems. In Proceedings of the REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, (Noordwijkerhout). Lecture Notes in Computer Science, vol. 354. Springer-Verlag, New York, 438-466
15. Degano, P. and Gorrieri, R. 1995. A causal operational semantics of action refinement. Inf. Comput. 122, 97-119
16. Devillers, R. 1992. Maximality preserving bisimulation. Theoret. Comput. Sci. 102, 165-183
17. Froschle, S. B. 1999. Decidability of plain and hereditary history-preserving bisimilarity for bpp. in Proceedings of the 6th International Workshop on Expressiveness in Concurrency (EXPRESS ‘99), ENTCS 27 (Eindhoven, The Netherlands)
18. Froschle, S. B., and Hildebrandt, T. T. 1999. On plain and hereditary history-preserving bisimulation. In Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS ‘99) (Szklarska Poreba, Poland). Lecture Notes in Computer Science, vol. 1672. Springer-Verlag, New York, 354-365
19. Gorrieri, R., and Laneve, C. 1991. The limit of split“ bisimulations for ccs agents. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS ‘91). Lecture Notes in Computer Science, vol. 520. Springer-Verlag, New York, 170-180
20. Gorrieri, R. and Laneve, C. 1992. An extensional formulation of st bisimulation. In Proceedings of the 4th Italian Conference on Theoretical Computer Science (ICTCS ‘92), P. M. A. Marchetti Spaccamela and M. V. Zilli, Eds. World Scientific, L'Aquila, Italy. 239-253
21. Gorrieri, R. and Laneve, C. 1995. Split and st bisimulation semantics. Inf. Comput. 118, 272-288
22. Gorrieri, R. and Rensink, A. 2001. Handbook of Process Algebra. Elsevier, Chapter Action Refinement
23. Hennessy, M. 1991. A proof system for weak st-bisimulation over a finite process algebra. Tech. Rep. 6/91, University of Sussex (UK)
24. Hoare, C. A. R. 1985. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, N.J
25. Jurdziinski, M. and Nielsen, M. 2000. Hereditary history preserving bisimilarity is undecidable. In Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science (STACS 2000) (Lille, France). Lecture Notes in Computer Science, vol. 1776. Springer-Verlag, New York, 358-369
26. Kiehn, A. and Hennessy, M. 1997. On the decidability of non-interleaving process equivalences. Fund. Inf. 30, 1, 18-33
27. Milner, R. 1984. A complete inference system for a class of regular behaviours. J. Comput. Syst. Sci. 28, 439-466
28. Milner, R. 1989a. Communication and Concurrency. Prentice Hall, Englewood Cliffs, N.J
29. Milner, R. 1989b. A complete axiomatization for observational congruence of finite-state behaviours. Inf. Comput. 81, 227-247
30. Montanari, U. and Pistore, M. 1997. Minimal transition systems for history-preserving bisimulation. In Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science (STACS'97). Lecture Notes in Computer Science, vol. 1260. Springer-Verlag, New York
31. Montanari, U. and Yankelevich, D. 1995. Location equivalence in parametric setting. Theoret. Comput. Sci. 149, 2, 299-332
32. Paige, R. and Tarjan, R. E. 1987. Three partition refinement algorithms. SIAM J. Comput. 16, 973-989
33. Plotkin, G. 1981. A structural approach to operational semantics. Tech. Rep. DAIMI FN-19, Department of Computer Science, Aarhus University
34. Rabinovich, A. and Trakhtenbrot, B. 1988. Behaviour structures and nets. Fund. Inf. 11, 357-404
35. Van Glabbeek, R. J. 1990. The refinement theorem for st-bisimulation semantics. In Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET ‘90) (Sea of Gallilea, Israel). 27-52
36. Van Glabbeek, R. J. and Goltz, U. 1989. Equivalence notions for concurrent systems and refinement of actions. Arbeitspapiere der GMD 366. Extended abstract in: Proceedings of the 14th International Symposium on Mathematical Foundations of Computer Science (MFCS ‘89), A. Kreczmar and G. Mirkowska ed. (Porsbka-Kozubnik, Poland). Lecture Notes in Computer Science, vol. 379. Springer-Verlag, New York, 237-248
37. Van Glabbeek, R. J. and Vaandrager, F. W. 1987. Petri net models for algebraic theories of concurrency. In Proceedings of the Conference on Parallel Architectures and Languages Europe (PARLE ‘87) (Eindhoven, The Netherlands). Lecture Notes in Computer Science, vol. 259. Springer-Verlag, New York, 224-242
38. Vogler, W. 1993. Bisimulation and action refinement. Theoret. Comput. Sci. 114, 173-200
39. Vogler, W. 1995. Timed testing of concurrent systems. Inf. Comput. 121, 149-171