scientific article; zbMATH DE number 1927572

zbMATH Open1012.68526MaRDI QIDQ4484497FDOQ4484497

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

Publication date: 12 June 2003

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

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

Mathematics Subject Classification ID

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

Cited In (11)

• Simulating tail asymptotics of a Markov chain
• Computing Densities for Markov Chains via Simulation
• Probabilistic weak simulation is decidable in polynomial time
• 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
• Title not available (Why is that?)
• Comparative branching-time semantics for Markov chains
• Compositional weak metrics for group key update
• Title not available (Why is that?)

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)