Skip to main navigation Skip to search Skip to main content

Taking it to the limit: approximate reasoning for Markov processes

  • Kim Guldstrand Larsen
  • , Radu Mardare
  • , Prakash Panangaden
  • , B. Rovan (Editor)
  • , V. Sassone (Editor)
  • , P. Widmayer (Editor)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We develop a fusion of logical and metrical principles for reasoning about Markov processes. More precisely, we lift metrics from processes to sets of processes satisfying a formula and explore how the satisfaction relation behaves as sequences of processes and sequences of formulas approach limits. A key new concept is dynamically-continuous metric bisimulation which is a property of (pseudo)metrics. We prove theorems about satisfaction in the limit, robustness theorems as well as giving a topological characterization of various classes of formulas. This work is aimed at providing approximate reasoning principles for Markov processes.
Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2012. MFCS 2012
EditorsB. Rovan, V. Sassone, P. Widmayer
Place of PublicationBerlin
Pages681–692
Number of pages12
Volume7464
ISBN (Electronic)978-3-642-32589-2
DOIs
Publication statusPublished - 2012

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743

Keywords

  • Markov process
  • convergent sequence
  • logical formula
  • approximate reasoning
  • Markov kernel

Fingerprint

Dive into the research topics of 'Taking it to the limit: approximate reasoning for Markov processes'. Together they form a unique fingerprint.

Cite this