Labelled Markov Processes: Stronger and Faster Approximations

Vincent Danos, Jos? Desharnais

Research output: Contribution to journalArticlepeer-review

Abstract

This paper proposes a measure-theoretic reconstruction of the approximation schemes developed for Labelled Markov Processes: approximants are seen as quotients with respect to sets of temporal properties expressed in a simple logic. This gives the possibility of customizing approximants with respect to properties of interest and is thus an important step towards using automated techniques intended for finite state systems, e.g. model checking, for continuous state systems.
The measure-theoretic apparatus meshes well with an enriched logic, extended with a greatest fix-point, and gives means to define approximants which retain cyclic properties of their target.
Original languageEnglish
Pages (from-to)341
Number of pages1
JournalLogic in Computer Science, Symposium on
Volume0
DOIs
Publication statusPublished - 2003

Fingerprint Dive into the research topics of 'Labelled Markov Processes: Stronger and Faster Approximations'. Together they form a unique fingerprint.

Cite this