scientific article
From MaRDI portal
Publication:4032309
zbMath0766.68099MaRDI QIDQ4032309
Publication date: 1 April 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reducibilityprobabilistic automatonbisimulation equivalencetrace equivalencefailure equivalenceprobabilistic labeled transition systemsreadiness equivalencefinite trace equivalenceinitiated labeled probabilistic transition systemsmaximal trace equivalence
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Comparative branching-time semantics for Markov chains, Unnamed Item, Model Checking Linear-Time Properties of Probabilistic Systems, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, On deciding some equivalences for concurrent processes, Deciding bisimilarity and similarity for probabilistic processes., From generic partition refinement to weighted tree automata minimization, Relating strong behavioral equivalences for processes with nondeterminism and probabilities, Optimal state-space lumping in Markov chains, Symbolic computation of differential equivalences, Probabilistic weak simulation is decidable in polynomial time, Approximating Markovian testing equivalence, Efficient Coalgebraic Partition Refinement, On deciding trace equivalences for processes, Bisimulation and Simulation Relations for Markov Chains
