scientific article; zbMATH DE number 1927574

zbMATH Open1012.68127MaRDI QIDQ4484499FDOQ4484499

Authors: Stefano Cattani, Roberto Segala 

Publication date: 12 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210371.htm

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (41)

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

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)