Pith. sign in

REVIEW

Indefinite waitings in MIRELA systems

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1506.03553 v1 pith:FJHYVYT5 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
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.