Sciweavers

31 search results - page 5 / 7
» Modelling and Proof Analysis of Interrupt Driven Scheduling
Sort
View
CUZA
2002
132views more  CUZA 2002»
13 years 7 months ago
A Process Algebra for Predictible Control Systems
This paper presents Process Algebra for Predictible Control Systems (PAPCS) as a model for specifying and analysis of concurrent, time and resource dependent, distributed control s...
Nicolae Marian
JSS
2010
89views more  JSS 2010»
13 years 2 months ago
Verification and validation of declarative model-to-model transformations through invariants
In this paper we propose a method to derive OCL invariants from declarative model-to-model transformations in order to enable their verification and analysis. For this purpose we ...
Jordi Cabot, Robert Clarisó, Esther Guerra,...
MOBIHOC
2008
ACM
14 years 7 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
CORR
2009
Springer
242views Education» more  CORR 2009»
13 years 5 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...