scientific article; zbMATH DE number 1927574
From MaRDI portal
Publication:4484499
Recommendations
- An efficient algorithm to determine probabilistic bisimulation
- Probabilistic bisimulation
- Probabilistic bisimulation and simulation algorithms by abstract interpretation
- Branching bisimulation for probabilistic systems: characteristics and decidability
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
- Deciding probabilistic automata weak bisimulation: theory and practice
- Bisimulation and cocongruence for probabilistic systems
- Branching bisimulation congruence for probabilistic systems
- Branching bisimulation congruence for probabilistic systems
- CONCUR 2004 - Concurrency Theory
Cited in
(42)- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation
- Model checking probabilistic systems
- Deciding bisimilarities on distributions
- CONCUR 2004 - Concurrency Theory
- On divergence-sensitive weak probabilistic bisimilarity
- Generic weakest precondition semantics from monads enriched with order
- scientific article; zbMATH DE number 149518 (Why is no real title available?)
- Probabilistic NetKAT
- Deciding probabilistic automata weak bisimulation: theory and practice
- Branching bisimulation congruence for probabilistic systems
- Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours
- Discrete time stochastic and deterministic Petri box calculus dtsdPBC
- Efficient Coalgebraic Partition Refinement
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems
- Probabilistic weak simulation is decidable in polynomial time
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states
- Cost preserving bisimulations for probabilistic automata
- Probabilistic bisimulation and simulation algorithms by abstract interpretation
- Weak bisimulation for probabilistic timed automata
- Abstract probabilistic automata
- Uniform random process model revisited
- Abstract probabilistic automata
- An efficient algorithm to determine probabilistic bisimulation
- Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC
- Formal verification of differential privacy for interactive systems (extended abstract)
- Branching bisimulation for probabilistic systems: characteristics and decidability
- Model checking linear-time properties of probabilistic systems
- Deciding Simulations on Probabilistic Automata
- Deciding probabilistic automata weak bisimulation in polynomial time
- Bisimulations meet PCTL equivalences for probabilistic automata
- Specification Theories for Probabilistic and Real-Time Systems
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- An algorithm for probabilistic alternating simulation
- Probabilistic bisimulation for realistic schedulers
- The quest for minimal quotients for probabilistic and Markov automata
- Probabilistic bisimulation for realistic schedulers
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Polynomial time decision algorithms for probabilistic automata
- Efficient and modular coalgebraic partition refinement
- Axiomatizations for probabilistic finite-state behaviors
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 Q4484499)
