Least Upper Bounds for Probability Measures and Their Applications to Abstractions

DOI10.1007/978-3-540-85361-9_23zbMath1160.68436OpenAlexW1492158240MaRDI QIDQ3541023

Ramesh Viswanathan, Mahesh Viswanathan, Rohit Chadha

Publication date: 25 November 2008

Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85361-9_23

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Least upper bounds for probability measures and their applications to abstractions ⋮ A Demonic Approach to Information in Probabilistic Systems ⋮ A logical duality for underspecified probabilistic systems ⋮ Compositional Abstraction for Stochastic Systems

This page was built for publication: Least Upper Bounds for Probability Measures and Their Applications to Abstractions