Deciding bisimilarity and similarity for probabilistic processes.
type: Item
instance of: scholarly article
title: Deciding bisimilarity and similarity for probabilistic processes.
zbMATH Open document ID: 1073.68690
author: Christel Baier
author: B. Engelen
author: Mila Majster-Cederbaum
published in: Journal of Computer and System Sciences
publication date: 2000-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1441903
MaRDI profile type: Publication
full work available at URL: jcss.1999.1683
OpenAlex ID: W1963619740
cites work: Axiomatizing probabilistic processes: ACP with generative probabilities
cites work: Symbolic model checking for probabilistic processes
cites work: Q4222911
cites work: Model checking of probabilistic and nondeterministic systems
cites work: A Theory of Communicating Sequential Processes
cites work: Q4038695
cites work: Testing preorders for probabilistic processes
cites work: Q5624995
cites work: Q4255553
cites work: Generating BDDs for symbolic model checking in CCS
cites work: Q3883524
cites work: An implementation of an efficient algorithm for bisimulation equivalence
cites work: Q3292914
cites work: Q4038723
cites work: Termination of Probabilistic Concurrent Program
cites work: A logic for reasoning about time and reliability
cites work: Q4252730
cites work: Q4032309
cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks
cites work: A calculus of communicating systems
cites work: Q3992568
cites work: Binary Search Trees of Bounded Balance
cites work: Testing equivalences for processes
cites work: Three Partition Refinement Algorithms
cites work: Q3907077
cites work: Verification of multiprocess probabilistic protocols
cites work: Processes with probabilities, priority and time
cites work: Bisimulation for probabilistic transition systems: A coalgebraic approach
DOI: 10.1006/JCSS.1999.1683
description: scientific article; zbMATH DE number 1441903