Electronic Proceedings in Theoretical Computer Science (2015-06-01)

Indefinite waitings in MIRELA systems

  • Johan Arcile,
  • Jean-Yves Didier,
  • Hanna Klaudel,
  • Raymond Devillers,
  • Artur Rataj

DOI
https://doi.org/10.4204/EPTCS.184.1
Journal volume & issue
Vol. 184, no. Proc. ESSS 2015
pp. 5 – 18

Abstract

Read online

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.