Selected publications at LSV: 2006

Abstract:
In the classical framework of formal languages, a refinement operation is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studied, because they describe a change in the specification level, from an abstract view to a more concrete one, or conversely. For timed systems, there is up to now no uniform notion of substitutions. In this paper, we study the timed substitutions in the general framework of signal-event languages, where both signals and events are taken into account. We prove that regular signal-event languages are closed under substitutions and inverse substitutions.

@inproceedings{BGP1-formats06,
   address = {Paris, France},
   author = {B{\'e}rard, B{\'e}atrice and Gastin, Paul and Petit, Antoine},
   booktitle = {{P}roceedings of the 4th {I}nternational {C}onference on {F}ormal {M}odelling and {A}nalysis of {T}imed {S}ystems ({FORMATS}'06)},
   DOI = {10.1007/11867340_6},
   editor = {Asarin, Eug{\`e}ne and Bouyer, Patricia},
   month = sep,
   pages = {67-81},
   publisher = {Springer},
   series = {Lecture Notes in Computer Science},
   title = {Refinements and abstractions of signal-event (timed) languages},
   url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGP1-formats06.pdf},
   volume = {4202},
   year = {2006},
}

About LSV