Norm functions for probabilistic bisimulations with delays

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

Volumn 1784 LNCS, Issue , 2000, Pages 1-16

  Baier, Christel ^a   Stoelinga, Mariëlle ^b  

^a UNIVERSITY OF BONN   (Germany)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; EQUIVALENCE CLASSES; POLYNOMIAL APPROXIMATION; ALGORITHMS; FAULT TOLERANCE;

BISIMULATION EQUIVALENCES; BISIMULATIONS; POLYNOMIAL-TIME ALGORITHMS; PROBABILISTIC BISIMULATIONS; PROBABILISTIC CHOICES; QUOTIENT SPACE; WEAK BISIMULATION;

FUNCTIONS;

EID: 84878626595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46432-8_1     Document Type: Conference Paper

References (43)

1. P. d'Argenio, H. Hermanns, J. Katoen: On Generative Parallel Composition, Proc. PROBMIV'98, ENTCS, Vol. 21, 1999.
2. J. Baeten, J. Bergstra, S. Smolka: Axiomatizing Probabilistic Processes: ACP with Generative Probabilities, Inf. and Comp., Vol. 122, pp 234-255, 1995.
3. C. Baier, B. Engelen, M. Majster-Cederbaum: Deciding Bisimilarity and Similarity for Probabilistic Systems, to appear in Journ. of Computer and System Sc., 2000.
4. C. Baier, H. Hermanns: Weak Bisimulation for Fully Probabilistic Processes, Proc. CAV'97, LNCS 1254, pp 119-130, 1997. (Pubitemid 127088970)
5. C. Baier, M. Kwiatkowska: Domain Equations for Probabilistic Processes, to appear in Mathematical Structures in Computer Science, 2000.
6. C. Baier, M. Stoelinga: Probabilistic Bisimulation and Simulation: Decidability, Complexity and Compositionality, Techn. Report, University Nijmegen, 1999.
7. T. Bolognesi, S. Smolka: Fundamental Results for the Verification of Observational Equivalence: a Survey, Proc. Protocol Specification, Testing and Verification, Elsevier Science Publishers, IFIP, pp 165-179, 1987.
8. 20 States and Beyond, Inform. and Computation, Vol. 98 (2), pp 142-170, 1992.
9. L. Christoff: Specification and Verification Methods for Probabilistic Processes, Ph. D. Thesis, Uppsala University, 1993.
10. L. Christoff, I. Christoff: Efficient Algorithms for Verification of Equivalences for Probabilistic Processes, Proc. CAV'91, LNCS 575, pp 310-321, 1991.
11. T. Cormen, C. Leiserson, R. Rivest: Introd. to Algorithms, McGraw Hill, 1996.
12. R. Enders, T. Filkorn, D. Taubner: Generating BDDs for Symbolic Model checking in CCS, Distributed Computing, Vol. 6, pp 155-164, 1993.
13. A. Giacalone, C. Jou, S. Smolka: Algebraic Reasoning for Probabilistic Concurrent Systems, Proc. IFIP TC2 Working Conf. on Prog. Concepts and Methods, 1990.
14. R. van Glabbeek: The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves, extended abstract, Proc. CONCUR'93, LNCS 715, pp 66-81, 1993.
15. R. van Glabbeek, S. Smolka, B. Steffen, C. Tofts: Reactive, Generative, and Stratified Models for Probabilistic Processes, Proc. LICS'90, pp 130-141, 1990.
16. R. van Glabbeek, W. Weijland: Branching Time and Abstraction in Bisimulation Semantics, Journal of the ACM, Vol. 43(3), pp 555-600, 1996. (Pubitemid 126607643)
17. D. Griffioen, F. Vaandrager: Normed Simulations, Proc. CAV'98, LNCS 1427, pp 332-344, 1998.
18. H. Hansson: Time and Probability in Formal Design of Distributed Systems, in Real-Time Safety Ciritical Systems, Vol. 1, Elsevier, 1994.
19. H. Hansson, B. Jonsson: A Calculus for Communicating Systems with Time and Probabilities, Proc. IEEE Real-Time Systems Symposium, IEEE Computer Society Press, pp 278-287, 1990.
20. T. Huynh, L. Tian: On some Equivalence Relations for Probabilistic Processes, Fundamenta Informaticae, Vol. 17, pp 211-234, 1992.
21. B. Jonsson, C. Ho-Stuart, W. Yi: Testing and Refinement for Nondeterministic and Probabilistic Processes, Proc. FTRTFT'94, LNCS 863, pp 418-430, 1994.
22. B. Jonsson, K.G. Larsen: Specification and Refinement of Probabilistic Processes, Proc. LICS'91, pp 266-277, 1991. (Pubitemid 21691977)
23. B. Jonsson, W. Yi: Compositional Testing Preorders for Probabilistic Processes, Proc. LICS'95, pp 431-443, 1995.
24. C. Jou, S. Smolka: Equivalences, Congruences and Complete Axiomatizations for Probabilistic Processes, Proc. CONCUR'90, LNCS 458, pp 367-383, 1990.
25. P. Kannelakis, S. Smolka: CCS Expressions, Finite State Processes and Three Problems of Equivalence, Information and Computation, Vol. 86, pp 43-68, 1990. (Pubitemid 20685318)
26. K. Larsen, A. Skou: Bisimulation through Probabilistic Testing, Information and Computation, Vol. 94, pp 1-28, 1991. (Pubitemid 21694897)
27. K. Larsen, A. Skou: Compositional Verification of Probabilistic Processes, Proc. CONCUR'92, LNCS 630, pp 456-471, 1992.
28. R. Milner: A Calculus of Communicating Systems, LNCS 92, 1980.
29. R. Milner: Communication and Concurrency, Prentice Hall, 1989.
30. R. Paige, R. Tarjan: Three Partition Refinement Algorithms, SIAM Journal of Computing, Vol. 16, No. 6, pp 973-989, 1987.
31. D. Park: Concurrency and Automata on Infinite Sequences, Proc. 5th GI Conference, LNCS 104, pp 167-183, 1981.
32. A. Philippou, O. Sokolsky, I. Lee: Weak Bisimulation for Probabilistic Systems, submitted for publication.
33. M. Puterman: Markov Decision Processes, John Wiley and Sons, 1994.
34. R. Segala: Modeling and Verification of Randomized Distributed Real-Time Systems, Ph.D. Thesis, Massachusetts Institute of Technology, 1995.
35. R. Segala: A Compositional Trace-Based Semantics for Probabilistic Automata, Proc. CONCUR'95, LNCS 962, pp 234-248, 1995.
36. R. Segala, N. Lynch: Probabilistic Simulations for Probabilistic Processes, Proc. CONCUR'94, LNCS 836, pp 481-496, 1994.
37. R. Segala, N. Lynch: Probabilistic Simulations for Probabilistic Processes, Nordic Journal of Computing, Vol. 2 (2), pp 250-273, 1995.
38. M. Stoelinga, F. Vaandrager: Root Contention in IEEE 1394, Proc. ARTS'99, LNCS 1601, pp 53-74, 1999.
39. M. Stoelinga: Hypernorms for Probabilistic Systems, in preparation, 2000.
40. W. Weijland: Synchrony and Asynchrony in Process Algebra, Ph.D. Thesis, Univesity of Amsterdam, 1989.
41. M. Vardi: Automatic Verification of Probabilistic Concurrent Finite-State Programs, Proc. FOCS'85, pp 327-338, 1985. (Pubitemid 16541431)
42. W. Yi, K. Larsen: Testing Probabilistic and Nondeterministic Processes, Proc. Protocol, Specification, Testing, Verification XII, pp 47-61, 1992.
43. W. Yi: Algebraic Reasoning for Real-Time Probabilistic Processes with Uncertain Information, Proc. FTRTFT'94, LNCS 863, pp 680-693, 1994.