• Publications
  • Influence
TIMES: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems
TLDR
Times is a tool suite designed mainly for symbolic schedulability analysis and synthesis of executable code with predictable behaviours for real time systems. Expand
  • 223
  • 22
  • PDF
Task automata: Schedulability, decidability and undecidability
TLDR
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks that are computation tasks generated (or triggered) by timed events. Expand
  • 169
  • 10
  • PDF
TIMES - A Tool for Modelling and Implementation of Embedded Systems
TLDR
Times is a modelling and schedulability analysis tool for embedded real-time systems, developed at Uppsala University in 2001. Expand
  • 152
  • 6
  • PDF
Schedulability analysis of fixed-priority systems using timed automata
TLDR
We show 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
  • 93
  • 5
  • PDF
Code Synthesis for Timed Automata
TLDR
We present a framework for the development of real time embedded systems based on timed automata extended with a notion of real-time tasks. Expand
  • 77
  • 5
  • PDF
Timed Automata with Asynchronous Processes: Schedulability and Decidability
TLDR
We extend timed automata with asynchronous processes i.e. tasks triggered by events as a model for real-time systems. Expand
  • 142
  • 4
  • PDF
A Generic Approach to Schedulability Analysis of Real-Time Tasks
TLDR
We present a unified task model, which is expressive enough to describe concurrency, synchronization, and tasks that may be periodic, aperiodic, preemptive or nonpreemptive. Expand
  • 48
  • 3
  • PDF
Schedulability Analysis Using Two Clocks
TLDR
In this paper, we show 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. Expand
  • 40
  • 2
  • PDF
Abstraction of Communication Channels in Promela: A Case Study
TLDR
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. Expand
  • 16
  • 1
  • PDF
A Generic Approach to Schedulability Analysis of Real-Time Systems
TLDR
Fersman, E. 2003: A Generic Approach to Schedulability Analysis of Real-Time Systems. Expand
  • 18
  • 1
  • PDF