697 search results - page 16 / 140 » Implementation of Timed Automata: An Issue of Semantics or M... |
IPPS
2003
IEEE
14 years 20 days ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Minimal change is a fundamental principle for modeling system dynamics. In this paper, we study the issue of minimal change for Computational Tree Logic (CTL) model update. We firs...
EMSOFT
2009
Springer
14 years 1 months ago
2009
Springer
This paper advocates a strict compositional and hybrid approach for obtaining key (performance) metrics of embedded At its core the developed methodology abstracts system componen...
IANDC
2010
13 years 6 months ago
2010
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
COORDINATION
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Reo is a channel-based coordination model whose operational semantics is given by Constraint Automata (CA). Quantitative Constraint Automata extend CA (and hence, Reo) wi...