scientific article; zbMATH DE number 1754609

zbMath0986.68093MaRDI QIDQ4535035

James Worrell, Franck Van Breugel

Publication date: 12 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760421

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

Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey, A metrized duality theorem for Markov processes, Complete axiomatization for the total variation distance of Markov chains, Symbolic Model Checking in Non-Boolean Domains, Metrics for labelled Markov processes, Weak bisimulation for probabilistic timed automata, SOS specifications for uniformly continuous operators, Explainability of probabilistic bisimilarity distances for labelled Markov chains, Approximating labelled Markov processes, Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis, Up-to techniques for behavioural metrics via fibrations, Unnamed Item, Compositional bisimulation metric reasoning with Probabilistic Process Calculi, Up-To Techniques for Behavioural Metrics via Fibrations, Model Checking Quantitative Linear Time Logic, Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations, The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata, Bisimulation for Markov Decision Processes through Families of Functional Expressions, Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice, A unified framework for differential aggregations in Markovian process algebra, Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes, A behavioural pseudometric for probabilistic transition systems, Measuring the confinement of probabilistic systems, Bisimulation and cocongruence for probabilistic systems, Logical characterization of branching metrics for nondeterministic probabilistic transition systems, Unnamed Item, Approximating and computing behavioural distances in probabilistic transition systems, On the metric-based approximate minimization of Markov chains, Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity, Simulation Hemi-metrics between Infinite-State Stochastic Games, Unnamed Item, Approximating Markov Processes by Averaging, Deciding probabilistic bisimilarity distance one for probabilistic automata, Monads and Quantitative Equational Theories for Nondeterminism and Probability, Differential logical relations, Part I: The simply-typed case, Bisimulation metrics and norms for real-weighted automata, \(\pi\)-calculus with noisy channels, Non Expansive ε-Bisimulations, Proving Approximate Implementations for Probabilistic I/O Automata