Bridging the gap between formal verification and schedulability analysis: The case of robotics
Authors:
- Mohammed FoughaliMFMohammed Foughali
- Pierre-Emmanuel HladikPHPierre-Emmanuel Hladik
- 1 December 2020
- journal article
- research article
- Published by Elsevier in Journal of Systems Architecture
- Vol. 111
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A survey of hard real-time scheduling for multiprocessor systemsACM Computing Surveys, 2011
- On the Implementation of Dependable Real-Time Systems with Non-Preemptive EDF2011
- Specification and verification of real-time systems using POLAInternational Journal of Critical Computer-Based Systems, 2011
- The tool TINA – Construction of abstract state spaces for petri nets and time petri netsInternational Journal of Production Research, 2004
- Weakly hard real-time systemsIEEE Transactions on Computers, 2001
- Pre-emptive versus non-pre-emptive real time scheduling in intelligent mobile roboticsJournal of Experimental & Theoretical Artificial Intelligence, 2000
- NUSMV: a new symbolic model checkerInternational Journal on Software Tools for Technology Transfer, 2000
- Symbolic Model Checking for Real-Time SystemsInformation and Computation, 1994
- A theory of timed automataTheoretical Computer Science, 1994
- Recoverability of Communication Protocols--Implications of a Theoretical StudyIEEE Transactions on Communications, 1976