Analysis of partially observed recursive tile systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Analysis of partially observed recursive tile systems

Abstract

The analysis of discrete event systems under partial observation is an important topic, with major applications such as the detection of information flow and the diagnosis of faulty behaviors. We consider recursive tile systems, which are infinite systems generated by a finite collection of finite tiles, a simplified variant of deterministic graph grammars. Recursive tile systems are expressive enough to capture classical models of recursive systems, such as the pushdown systems and the recursive state machines. They are infinite-state in general and therefore standard powerset constructions for monitoring do not always apply. We exhibit computable conditions on recursive tile systems and present non-trivial constructions that yield effective computation of the monitors. We apply these results to the classic problems of opacity and diagnosability.
Fichier principal
Vignette du fichier
wodes2012.pdf (160.8 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00743196 , version 1 (18-10-2012)

Identifiers

  • HAL Id : hal-00743196 , version 1

Cite

Sébastien Chédor, Christophe Morvan, Sophie Pinchinat, Hervé Marchand. Analysis of partially observed recursive tile systems. 11th Int. Workshop on Discrete Event Systems, Oct 2012, Guadalajara, Mexico. pp.265-271. ⟨hal-00743196⟩
140 View
97 Download

Share

Gmail Facebook X LinkedIn More