Approximate reasoning for real-time probabilistic processes

DOI10.2168/LMCS-2(1:4)2006MaRDI QIDQ5310651zbMATH OpenOpenAlexFDO

Authors Vineet Gupta, Radha Jagadeesan, Prakash Panangaden

Publication date 11 October 2007

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-2(1:4)2006

Mathematics Subject Classification ID

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

Recommendations

• Taking it to the limit: approximate reasoning for Markov processes
• scientific article; zbMATH DE number 1956514
• Compositional bisimulation metric reasoning with Probabilistic Process Calculi
• Compositional metric reasoning with probabilistic process calculi
• scientific article; zbMATH DE number 1696897

Cited in

(13)

• Bisimulation for Feller-Dynkin processes
• Approximating and computing behavioural distances in probabilistic transition systems
• Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
• scientific article; zbMATH DE number 1696897 (Why is no real title available?)
• Quantitative abstractions for collective adaptive systems
• A metrized duality theorem for Markov processes
• Taking it to the limit: approximate reasoning for Markov processes
• Compositional metric reasoning with probabilistic process calculi
• Real-World Reasoning: Toward Scalable, Uncertain Spatiotemporal, Contextual and Causal Inference
• On behavioural pseudometrics and closure ordinals
• TCC, with history
• A behavioural pseudometric for continuous-time Markov processes
• Language-based abstractions for dynamical systems

This page was built for publication: Approximate reasoning for real-time probabilistic processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310651)