Sciweavers

475 search results - page 21 / 95
» Formal Analysis of Processor Timing Models
Sort
View
FORMATS
2003
Springer
14 years 19 days ago
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
RTAS
2007
IEEE
14 years 1 months ago
A Programming Model for Time-Synchronized Distributed Real-Time Systems
Discrete-event (DE) models are formal system specifications that have analyzable deterministic behaviors. Using a global, consistent notion of time, DE components communicate via...
Yang Zhao, Jie Liu, Edward A. Lee
TMI
2010
175views more  TMI 2010»
13 years 2 months ago
Spatially Adaptive Mixture Modeling for Analysis of fMRI Time Series
Within-subject analysis in fMRI essentially addresses two problems, the detection of brain regions eliciting evoked activity and the estimation of the underlying dynamics. In [1, 2...
Thomas Vincent, Laurent Risser, Philippe Ciuciu
FSEN
2009
Springer
14 years 2 months ago
Modular Schedulability Analysis of Concurrent Objects in Creol
We present an automata theoretic framework for modular schedulability analysis of real time asynchronous objects modeled in the language Creol. In previous work we analyzed the sch...
Frank S. de Boer, Tom Chothia, Mohammad Mahdi Jagh...
TACAS
2007
Springer
131views Algorithms» more  TACAS 2007»
14 years 1 months ago
From Time Petri Nets to Timed Automata: An Untimed Approach
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...
Davide D'Aprile, Susanna Donatelli, Arnaud Sangnie...