scientific article; zbMATH DE number 149518

MaRDI QIDQ4032309zbMATH OpenFDO

Authors Dung T. Huynh, Lu Tian

Publication date 1 April 1993

zbMATH Keywords

bisimulation equivalencefailure equivalencefinite trace equivalenceinitiated labeled probabilistic transition systemsmaximal trace equivalenceprobabilistic automatonprobabilistic labeled transition systemsreadiness equivalencereducibilitytrace equivalence

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Deciding bisimilarity and similarity for probabilistic processes.
• (In)finite trace equivalence of probabilistic transition systems
• Deciding probabilistic bisimilarity over infinite-state probabilistic systems
• CONCUR 2004 - Concurrency Theory
• scientific article; zbMATH DE number 1927574

Cited in

(27)

• Optimal state-space lumping in Markov chains
• Probabilistic weak simulation is decidable in polynomial time
• Constructive equivalence relations on computable probability measures
• On deciding trace equivalences for processes
• (In)finite trace equivalence of probabilistic transition systems
• 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
• Comparative branching-time semantics for Markov chains
• EQUIVALENCE OF LABELED MARKOV CHAINS
• Equivalent deterministic inputs for random processes
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• On deciding some equivalences for concurrent processes
• Model checking linear-time properties of probabilistic systems
• Efficient Coalgebraic Partition Refinement
• Efficient and modular coalgebraic partition refinement
• Bisimulation and Simulation Relations for Markov Chains
• Equivalent definitions of the probabilistic characteristics of models with repeated calls and their application
• Symbolic computation of differential equivalences
• Deciding bisimulation and trace equivalences for systems with many identical processes
• Distributed coalgebraic partition refinement
• Generic partition refinement and weighted tree automata
• Uniform random process model revisited
• Trace machines for observing continuous-time Markov chains
• Trace semantics for stochastic systems with nondeterminism
• Design and optimisation of the FlyFast front-end for attribute-based coordination
• Approximating Markovian testing equivalence

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032309)