English

Continuous Markovian Logics - Axiomatization and Quantified Metatheory

Logic in Computer Science 2015-07-01 v2

Abstract

Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes (CMPs). The modalities of CML evaluate the rates of the exponentially distributed random variables that characterize the duration of the labeled transitions of a CMP. In this paper we present weak and strong complete axiomatizations for CML and prove a series of metaproperties, including the finite model property and the construction of canonical models. CML characterizes stochastic bisimilarity and it supports the definition of a quantified extension of the satisfiability relation that measures the "compatibility" between a model and a property. In this context, the metaproperties allows us to prove two robustness theorems for the logic stating that one can perturb formulas and maintain "approximate satisfaction".

Keywords

Cite

@article{arxiv.1211.5190,
  title  = {Continuous Markovian Logics - Axiomatization and Quantified Metatheory},
  author = {Radu Mardare and Luca Cardelli and Kim G. Larsen},
  journal= {arXiv preprint arXiv:1211.5190},
  year   = {2015}
}

Comments

Extended version of a paper presented at CSL2011

R2 v1 2026-06-21T22:42:30.613Z