arxiv: 1506.03553 · v1 · pith:FJHYVYT5new · submitted 2015-06-11 · 💻 cs.SE · cs.LO

Indefinite waitings in MIRELA systems

Johan Arcile (Laboratoire IBISC , Universit\'e d'Evry-Val d'Essonne) , Jean-Yves Didier (Laboratoire IBISC , Hanna Klaudel (Laboratoire IBISC , Raymond Devillers (D\'epartement d'Informatique , Universit\'e Libre de Bruxelles) , Artur Rataj (Institute of Theoretical , Applied Computer Science) This is my paper

classification 💻 cs.SE cs.LO

keywords systemsindefinitemirelawaitingsautomatacheckedcheckercoexist

0 comments

read the original abstract

MIRELA is a high-level language and a rapid prototyping framework dedicated to systems where virtual and digital objects coexist in the same environment and interact in real time. Its semantics is given in the form of networks of timed automata, which can be checked using symbolic methods. This paper shows how to detect various kinds of indefinite waitings in the components of such systems. The method is experimented using the PRISM model checker.

This paper has not been read by Pith yet.

Indefinite waitings in MIRELA systems

discussion (0)