See this document in CiteSeerX!

Compositional Reasoning for Probabilistic Finite-State Behaviors  (Make Corrections)  
Yuxin Deng, Catuscia Palamidessi, Jun Pang



  Home/Search   Context   Related

 
View or download:
pps.jussieu.fr/~yuxin/publicat...par.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  pps.jussieu.fr/~yuxin/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch's simple probabilistic automata. We consider strong bisimulation and observational equivalence, and provide complete axiomatizations for a language that includes a restricted form of parallel composition and (guarded) recursion. The presence of the parallel composition, in particular, introduces various technical di#culties, but we believe that a "good" ... (Update)

Active bibliography (related documents):   More   All
0.6:   Axiomatizations for Probabilistic Finite-State Behaviors - Deng, Palamidessi (2005)   (Correct)
0.5:   Metrics for Action-labelled Quantitative Transition Systems - Deng, Chothia.. (2005)   (Correct)
0.5:   On Generalised Coinduction and Probabilistic Specification.. - Bartels (2004)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ deng-compositional,
  author = "Yuxin Deng and Catuscia Palamidessi and Jun Pang",
  title = "Compositional Reasoning for Probabilistic Finite-State Behaviors",
  url = "citeseer.ist.psu.edu/741524.html" }
Citations (may not include all citations):
2732   Communicating Sequential Processes (context) - Hoare - 1985
1933   Communication and Concurrency (context) - Milner - 1989
357   Algebraic laws for nondeterminism and concurrency (context) - Hennessy, Milner - 1985
247   Bisimulation through probabilistic testing (context) - Larsen, Skou - 1991
218   Process algebra for synchronous communications (context) - Bergstra, Klop - 1984
216   Theoretical Computer Science (context) - Milner, synchrony - 1983
174   Probabilistic simulations for probabilistic processes - Segala, Lynch - 1994
93   A complete inference system for a class of regular behaviour.. (context) - Milner - 1984
89   volume 18 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Baeten, Weijland - 1990
73   Algebraic reasoning for probabilistic concurrent systems - Giacalone, Jou et al. - 1990
71   Decidability and Decomposition (context) - Christensen - 1993
57   Axiomatizing probabilistic processes: ACP with generative pr.. (context) - Baeten, Bergstra et al. - 1995
44   A complete axiomatisation for observational congruence of fi.. (context) - Milner - 1989
37   Proving time bounds for randomized distributed algorithms - Lynch, Saias et al. - 1994
34   Root contention in IEEE - Stoelinga, Vaandrager - 1999
15   Decidable subsets of ccs (context) - Christensen, Hirshfeld et al. - 1994
14   Verification of an alternating bit protocol by means of proc.. (context) - Bergstra, Klop - 1986
14   A complete inference system for regular processes with silen.. (context) - Bergstra, Klop - 1988
14   Linearization in parallel pCRL - Groote, Ponse et al. - 2001
14   Verification of the randomized consensus algorithm of Aspnes.. - Pogosyants, Segala et al. - 2000
10   Axiomatizations for probabilistic bisimulation (context) - Bandini, Segala - 2001
6   A complete axiomatization for branching bisimulation congrue.. (context) - van Glabbeek - 1993
5   A complete axiom system for finite-state probabilistic proce.. - Stark, Smolka - 2000
5   parallel composition and comparison (context) - Sokolova, de Vink et al. - 2004
5   Electronic Notes in Theoretical Computer Science (context) - D'Argenio, Hermanns et al. - 1999
4   Deciding and axiomatizing weak ST bisimulation for a process.. - Bravetti, Gorrieri - 2002
4   Verifying a sliding window protocol in CRL - Fokkink, Groote et al. - 2004
4   Equational axioms for probabilistic bisimilarity (context) - Aceto, Esik et al. - 2002
3   Axiomatizations for probabilistic finite-state behaviors - Deng, Palamidessi - 2005
2   Probabilistic Process Algebra (context) - Andova - 2002
1   The quest for equational axiomatizations of parallel composi.. (context) - Aceto, Fokkink - 2005
1   Axiomatisations and types for probabilistic and mobile proce.. (context) - Deng - 2005
1   Edindhoven University of Technology (context) - Usenko, CRL - 2002
1   A ground-complete axiomatization of finite state processes (context) - Baeten, Bravetti - 2005

Documents on the same site (http://www.pps.jussieu.fr/~yuxin/):   More
Metrics for Action-labelled Quantitative Transition Systems - Deng, Chothia.. (2005)   (Correct)
Towards an Algebraic Theory of Typed Mobile Processes - Deng, Sangiorgi   (Correct)
Axiomatizations for Probabilistic Finite-State Behaviors - Deng, Palamidessi (2005)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC