Name
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 parallel composition and (guarded) recursion. The presence of the parallel composition introduces various technical difficulties and some restrictions are necessary in order to achieve complete axiomatizations. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11601548_17 | Processes, Terms and Cycles |
Keywords | Field | DocType |
probabilistic behavior,probabilistic finite-state behavior,compositional reasoning,process algebra,parallel composition,observational equivalence,strong bisimulation,simple probabilistic automaton,complete axiomatizations,various technical difficulty,probabilistic automata | Discrete mathematics,Nondeterministic algorithm,Observational equivalence,Computer science,Finite-state machine,Bisimulation,Probabilistic logic,Process calculus,Recursion,Probabilistic automaton | Conference |
Volume | ISSN | ISBN |
3838 | 0302-9743 | 3-540-30911-X |
Citations | PageRank | References |
14 | 0.68 | 27 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuxin Deng | 1 | 413 | 30.41 |
| Catuscia Palamidessi | 2 | 2876 | 184.08 |
| Jun Pang | 3 | 521 | 30.59 |