Modular Markovian Logic

DOI10.1007/978-3-642-22012-8_30zbMath1333.68200OpenAlexW205932529WikidataQ56981916 ScholiaQ56981916MaRDI QIDQ3012934

Luca Cardelli, Radu Mardare, Kim Guldstrand Larsen

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_30

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Logic in computer science (03B70) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Concurrent weighted logic ⋮ Unnamed Item ⋮ Compositionality for quantitative specifications ⋮ Logical vs. behavioural specifications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
• Interactive epistemology. II: Probability
• A spatial logic for concurrency. I
• Bisimulation for labelled Markov processes
• Decidability of Modular Logics for Concurrency
• A Complete Axiomatic System for a Process-Based Spatial Logic
• Algebraic laws for nondeterminism and concurrency
• Communicating sequential processes
• Reasoning about knowledge and probability
• Anytime, anywhere
• YMCA
• Stochastic Relations
• The Measurable Space of Stochastic Processes
• Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
• Probability logic for type spaces

This page was built for publication: Modular Markovian Logic