Deciding bisimilarity and similarity for probabilistic processes.
From MaRDI portal
Publication:1975973
Recommendations
Cites work
- A calculus of communicating systems
- A logic for reasoning about time and reliability
- A Theory of Communicating Sequential Processes
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- An implementation of an efficient algorithm for bisimulation equivalence
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Binary Search Trees of Bounded Balance
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- Generating BDDs for symbolic model checking in CCS
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 149518 (Why is no real title available?)
- scientific article; zbMATH DE number 177817 (Why is no real title available?)
- scientific article; zbMATH DE number 177845 (Why is no real title available?)
- scientific article; zbMATH DE number 1231591 (Why is no real title available?)
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 1324654 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- Model checking of probabilistic and nondeterministic systems
- Processes with probabilities, priority and time
- Symbolic model checking for probabilistic processes
- Termination of Probabilistic Concurrent Program
- Testing equivalences for processes
- Testing preorders for probabilistic processes
- Three Partition Refinement Algorithms
- Verification of multiprocess probabilistic protocols
Cited in
(57)- Probabilistic weak simulation is decidable in polynomial time
- Deciding bisimilarity is P-complete
- Automatic verification of real-time systems with discrete probability distributions.
- Exploring probabilistic bisimulations. I
- From generic partition refinement to weighted tree automata minimization
- A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
- On well-founded and recursive coalgebras
- Discrete time stochastic and deterministic Petri box calculus dtsdPBC
- Verifying quantum communication protocols with ground bisimulation
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Comparative branching-time semantics for Markov chains
- Bisimulation relations for weighted automata
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems
- A space-efficient simulation algorithm on probabilistic automata
- An efficient algorithm to determine probabilistic bisimulation
- Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
- Weak bisimulations for fuzzy automata
- Quantitative abstractions for collective adaptive systems
- An algorithm for probabilistic alternating simulation
- A general framework for probabilistic characterizing formulae
- On the complexity of computing probabilistic bisimilarity
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- Differential bisimulation for a Markovian process algebra
- Probabilistic bisimulation and simulation algorithms by abstract interpretation
- The how and why of interactive Markov chains
- Bisimulations meet PCTL equivalences for probabilistic automata
- Weighted Bisimulation in Linear Algebraic Form
- Deciding Simulations on Probabilistic Automata
- A Space-Efficient Probabilistic Simulation Algorithm
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- scientific article; zbMATH DE number 149518 (Why is no real title available?)
- Three-valued abstraction for probabilistic systems
- scientific article; zbMATH DE number 1927588 (Why is no real title available?)
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
- Game characterization of probabilistic bisimilarity, and applications to pushdown automata
- Converging from branching to linear metrics on Markov chains
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- Polynomial time decision algorithms for probabilistic automata
- Bisimulations for probabilistic and quantum processes (invited paper)
- A coalgebraic take on regular and -regular behaviours
- 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
- CONCUR 2004 - Concurrency Theory
- Probabilistic simulation for probabilistic data-aware business processes
- Formal verification of differential privacy for interactive systems (extended abstract)
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
- Symbolic computation of differential equivalences
- Deciding probabilistic bisimilarity distance one for labelled Markov chains
- A Hemimetric Extension of Simulation for Semi-Markov Decision Processes
- Generic partition refinement and weighted tree automata
- Uniform random process model revisited
- A cancellation law for probabilistic processes
- The Kantorovich metric in computer science: a brief survey
- Language-based abstractions for dynamical systems
This page was built for publication: Deciding bisimilarity and similarity for probabilistic processes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975973)
