Abstraction in probabilistic process algebra

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

Volumn 2031 LNCS, Issue , 2001, Pages 204-219

  Andova, S ^a   Baeten, J C M ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES; POLYNOMIAL APPROXIMATION; ABSTRACTING; ALGORITHMS;

ALGEBRAIC APPROACHES; BISIMULATION RELATIONS; BRANCHING BISIMULATION; MARKOV CHAIN ANALYSIS; POLYNOMIAL TIME COMPLEXITY; PROBABILISTIC PROCESS ALGEBRA; PROBABILISTIC SYSTEMS; SPECIFICATION AND VERIFICATION; PROBABILITY MEASURES;

ABSTRACTING; ALGEBRA;

EID: 84903174820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_15     Document Type: Conference Paper

References (11)

1. A. Aho, J. Hopcroft, J. Ullman, The design and analysis of computer algorithms, Addison-Wesley Publishing Company, 1974.
2. S. Andova, Process algebra with probabilistic choice (extended abstract), Proc. ARTS'99, Bamberg, Germany, J.-P. Katoen, ed., LNCS 1601, Springer-Verlag, pp. 111-129, 1999. Full version report CSR 99-12, Eindhoven University of Technology, 1999.
3. S. Andova, Process algebra with interleaving probabilistic parallel composition, Eindhoven University of Technology, CSR 99-04, 1999.
4. S. Andova, J.C.M. Baeten, Abstraction in probabilistic process algebra (extended abstract), http://www.win.tue.nl/~suzana.
5. J.C.M. Baeten, J.A. Bergstra, J.W. Klop, On the consistency of Koomen's fair abstraction rule, Theor. Comp. Sci. 51, pp.129-176, 1987.
6. J.C.M. Baeten, J.A. Bergstra, S.A. Smolka, Axiomatizing probabilistic processes: AGP with generative probabilities, Information and Computation 121(2), pp. 234-255, Sep. 1995.
7. J.C.M. Baeten, W. P. Weijland, Process algebra, Cambridge University Press, 1990.
8. C. Baier, On algorithmic verification methods for probabilistic systems, Habilitation thesis, Univ. Mannheim, 1998.
9. C. Baier, H. Hermanns, Weak bisimulation for fully probabilistic processes, Proc. CAV'97, LNCS 1254, pp. 119-130, 1997.
10. J.F. Groote, F. Vaandrager, An efficient algorithm for branching bisimulation and stuttering equivalence, Proc. ICALP'90, LNCS 443, pp. 626-638, 1990.
11. C.-C. Jou, Aspects of probabilistic process algebra, Ph.D. Thesis, State University of New York at Stony Brook, 1990.