scientific article; zbMATH DE number 1927572

MaRDI QIDQ4484497zbMATH OpenFDO

Authors Holger Hermanns, B. R. Haverkort, Christel Baier, Joost-Pieter Katoen

Publication date 12 June 2003

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

Mathematics Subject Classification ID

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

Recommendations

• Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
• Comparative branching-time semantics for Markov chains
• CONCUR 2003 - Concurrency Theory
• Bisimulation and Simulation Relations for Markov Chains
• Theoretical Aspects of Computing – ICTAC 2005

Cited in

(14)

• Pre-orders for reasoning about stability
• Simulating tail asymptotics of a Markov chain
• Computing Densities for Markov Chains via Simulation
• Probabilistic weak simulation is decidable in polynomial time
• Equational reasonings in wireless network gossip protocols
• A probabilistic calculus of cyber-physical systems
• Branching Technique for Markov Chain Simulation (Finite State Case)
• Simulation from endpoint-conditioned, continuous-time Markov chains on a finite state space, with applications to molecular evolution
• Simulation of program execution using popular Markov chains
• Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
• Comparative branching-time semantics for Markov chains
• scientific article; zbMATH DE number 3942984 (Why is no real title available?)
• Theoretical Aspects of Computing – ICTAC 2005
• Compositional weak metrics for group key update

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 Q4484497)