Equational axioms for probabilistic bisimilarity

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

Volumn 2422, Issue , 2002, Pages 239-254

  Aceto, Luca ^a   Ésik, Zoltán ^b   Ingólfsdóttir, Anna ^a  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; EQUIVALENCE CLASSES;

AXIOM SCHEMAS; AXIOMATIZATION; FINITE STATE; FIXED POINT OPERATOR; ITERATION THEORY; MONOTONIC FUNCTIONS; PROBABILISTIC BISIMILARITY; PROBABILISTIC BISIMULATIONS;

ITERATIVE METHODS;

EID: 84944074568     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45719-4_17     Document Type: Conference Paper

References (24)

1. L. Aceto, Z. Èsik, and A. Ingólfsdóttir, Equational axioms for probabilistic bisimilarity (preliminary report), Report RS-02-6, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), February 2002. Available at the URL http://www.brics.dk/RS/02/6/index.html. 247
2. J. C. M. Baeten, J. A. Bergstra, and S. A. Smolka, Axiomatizing probabilistic processes: ACP with generative probabilities, Inform. and Comput., 121 (1995), pp. 234–255. 239
3. J. W. de Bakker and D. Scott, A theory of programs, Technical Report, IBM Laboratory, Vienna, 1969. 245
4. E. Bandini and R. Segala, Axiomatizations for probabilistic bisimulation, in Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) 2001, vol. 2076 of Lecture Notes in Computer Science, Springer-Verlag, July 2001, pp. 370–381. 239, 244
5. H. Bekič, Definable operations in general algebras, and the theory of automata and flowcharts, Technical Report, IBM Laboratory, Vienna, 1969. 245
6. S. L. Bloom and Z. ésik, Iteration theories, Springer-Verlag, Berlin, 1993. 240, 241, 244, 252
7. S. L. Bloom and Z. ésik. The equational logic of fixed points, Theoret. Comput. Sci., 179 (1997), pp. 1–60. 244
8. J. H. Conway, Regular Algebra and Finite Machines, Mathematics Series (R. Brown and J. De Wet eds.), Chapman and Hall, London, United Kingdom, 1971. 244
9. C. C. Elgot, S. L. Bloom, and R. Tindell, On the algebraic structure of rooted trees, J. Comput. System Sci., 16 (1978), pp. 362–399. 249
10. Z. ésik, Independence of the equational axioms for iteration theories, J. Comput. System Sci., 36 (1988), pp. 66–76. 241
11. Z. ésik, Completeness of Park induction, Theoret. Comput. Sci., 177 (1997), pp. 217–283. Mathematical foundations of programming semantics (Manhattan, KS, 1994). 244
12. Z. ésik, Group axioms for iteration, Inform. and Comput., 148 (1999), pp. 131–180. 240, 244
13. W. J. Fokkink, Introduction to Process Algebra, Texts in Theoretical Computer Science, An EATCS Series, Springer-Verlag, 2000. 240
14. H. Hansson, Time and Probability in Formal Design of Distributed Systems, vol. 1 of Real-Time Safety Critical Systems, Elsevier, 1994. 239, 240
15. B. Jonsson, W. Yi, and K. G. Larsen, Probabilistic extensions of process algebras, in Handbook of Process Algebra, North-Holland, Amsterdam, 2001, pp. 685–710. 239, 244
16. C.-C. Jou, Aspects of Probabilistic Process Algebra, PhD thesis, SUNY at Stony Brook, Stony Brook, New York, 1991. 239, 240
17. C.-C. Jou and S. A. Smolka, Equivalences, congruences, and complete axiomatizations for probabilistic processes, in Proceedings CONCUR 90, Amsterdam, J. Baeten and J. Klop, eds., vol. 458 of Lecture Notes in Computer Science, Springer-Verlag, 1990, pp. 367–383. 239, 240
18. D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, Inform. and Comput., 110 (1994), pp. 366–390. 240
19. D. Krob, Complete systems of B-rational identities, Theoretical Comput. Sci., 89 (1991), pp. 207–343. 240, 244
20. K. G. Larsen and A. Skou, Bisimulation through probabilistic testing, Information and Computation, 94 (1991), pp. 1–28. 244
21. K. G. Larsen and A. Skou, Compositional verification of probabilistic processes, in Proceedings CONCUR 92, Stony Brook, NY, USA, W. R. Cleaveland, ed., vol. 630 of Lecture Notes in Computer Science, Springer-Verlag, 1992, pp. 456–471. 239
22. R. Milner, A complete inference system for a class of regular behaviours, J. Comput. System Sci., 28 (1984), pp. 439–466. 240, 249
23. A. Salomaa, Two complete axiom systems for the algebra of regular events, J. Assoc. Comput. Mach., 13 (1966), pp. 158–169. 240
24. E. W. Stark and S. A. Smolka, A complete axiom system for finite-state probabilistic processes, in Proof, Language, and Interaction: Essays in Honour of Robin Milner, MIT Press, Cambridge, MA, 2000, pp. 571–595. 239, 240, 241, 242, 243, 244, 245, 247, 249, 250