scientific article; zbMATH DE number 1927574

zbMath1012.68127MaRDI QIDQ4484499

Roberto Segala, Stefano Cattani

Publication date: 12 June 2003

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Deciding probabilistic automata weak bisimulation: theory and practice, An Algorithm for Probabilistic Alternating Simulation, Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours, Model Checking Probabilistic Systems, An efficient algorithm to determine probabilistic bisimulation, Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC, Unnamed Item, Model Checking Linear-Time Properties of Probabilistic Systems, Axiomatizations for probabilistic finite-state behaviors, Probabilistic bisimulation for realistic schedulers, Computing Behavioral Relations for Probabilistic Concurrent Systems, Weak bisimulation for probabilistic timed automata, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Abstract probabilistic automata, Generic weakest precondition semantics from monads enriched with order, On divergence-sensitive weak probabilistic bisimilarity, Deciding Simulations on Probabilistic Automata, Discrete time stochastic and deterministic Petri box calculus dtsdPBC, Polynomial time decision algorithms for probabilistic automata, Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states, Deciding probabilistic bisimilarity over infinite-state probabilistic systems, Specification Theories for Probabilistic and Real-Time Systems, Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract), Branching bisimulation for probabilistic systems: characteristics and decidability, On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems, The quest for minimal quotients for probabilistic and Markov automata, Probabilistic NetKAT, Probabilistic Bisimulation for Realistic Schedulers, Abstract Probabilistic Automata, Bisimulations Meet PCTL Equivalences for Probabilistic Automata, Probabilistic weak simulation is decidable in polynomial time, Branching bisimulation congruence for probabilistic systems, Efficient Coalgebraic Partition Refinement