Logic in Computer Science (LICS 2003)

Paper: Labelled Markov Processes: Stronger and Faster Approximations (at LICS 2003)

Authors: Vincent Danos Josée Desharnais

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.

BibTeX

  @InProceedings{DanosDesharnais-LabelledMarkovProce,
    author = 	 {Vincent Danos and Josée Desharnais},
    title = 	 {Labelled Markov Processes: Stronger and Faster Approximations},
    booktitle =  {Proceedings of the Eighteenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2003},
    year =	 2003,
    editor =	 {Phokion G. Kolaitis},
    month =	 {June}, 
    pages =      {341--350},
    location =   {Ottawa, Canada}, 
    publisher =	 {IEEE Computer Society Press}
  }