Compositional reasoning for probabilistic finite-state behaviors

  • Yuxin Deng*
  • , Catuscia Palamidessi
  • , Jun Pang
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

19 Scopus citations

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.

Original languageEnglish
Title of host publicationProcesses, Terms and Cycles
Subtitle of host publicationSteps on the Road to Infinity - Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday
PublisherSpringer Verlag
Pages309-337
Number of pages29
ISBN (Print)354030911X, 9783540309116
DOIs
StatePublished - 2005
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3838 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Compositional reasoning for probabilistic finite-state behaviors'. Together they form a unique fingerprint.

Cite this