• Publications
  • Influence
TIMES: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems
The design and main features of Times are presented including a summary of theoretical results behind the tool and a model checker e.g. UPPAAL is presented. Expand
Task automata: Schedulability, decidability and undecidability
The first technical result shows that the schedulability checking problem will be undecidable if the following three conditions hold: the execution times of tasks are intervals, the precise finishing time of a task instance may influence new task releases, and a task is allowed to preempt another running task. Expand
Schedulability analysis of fixed-priority systems using timed automata
This paper shows that for fixed-priority scheduling strategy, the schedulability checking problem can be solved using standard timed automata with two extra clocks in addition to the clocks used in the original model to describe task arrival times. Expand
TIMES - A Tool for Modelling and Implementation of Embedded Systems
This work provides a graphical interface for editing and simulation, and an engine for schedulability analysis, for embedded real-time systems that can be described as a set of preemptive or non-preemptive tasks which are triggered periodically or sporadically by time or external events. Expand
Code Synthesis for Timed Automata
This paper describes how to compile design models to executable programs with predictable behaviours and ensures that the execution of the generated code satisfies mixed timing, resource and logical constraints imposed on the design model. Expand
Timed Automata with Asynchronous Processes: Schedulability and Decidability
This paper exend timed automata with asynchronous processes i.e. tasks triggered by events as a model for real-time systems and achieves the first general decidability result on dense-time models for real time scheduling without assuming that preemptions occur only at integer time points. Expand
A Generic Approach to Schedulability Analysis of Real-Time Tasks
This paper proposes a unified task model, which is expressive enough to describe concurrency, synchronization, and tasks that may be periodic, aperiodic, preemptive or nonpreemptive with (or without) combinations of timing, precedence, and resource constraints. Expand
Schedulability Analysis Using Two Clocks
This paper shows that for fixed priority scheduling strategy, the schedulability checking problem can be solved by reachability analysis on standard timed automata using only two extra clocks in addition to the clocks used in the original model to describe task arrival times. Expand
Knowledge Representation of Cyber-physical Systems for Monitoring Purpose
Automated warehouses, as a form of cyber-physical systems (CPSs), require several components to work collaboratively to address the common business objectives of complex logistics systems. During tExpand
Abstraction of Communication Channels in Promela: A Case Study
We present a case study of how abstractions can be applied to a protocol model, written in Promela, in order to make in amenable for exhaustive state-space exploration, e.g., by SPIN. The protocol isExpand