Sciweavers

436 search results - page 47 / 88
» Decomposing constraint systems: equivalences and computation...
Sort
View
AAAI
2004
13 years 10 months ago
Low-Knowledge Algorithm Control
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
Tom Carchrae, J. Christopher Beck
RTSS
2005
IEEE
14 years 2 months ago
Trading End-to-End Latency for Composability
The periodic resource model for hierarchical, compositional scheduling abstracts task groups by resource requirements. We study this model in the presence of dataflow constraints...
Slobodan Matic, Thomas A. Henzinger
TASE
2008
IEEE
13 years 8 months ago
Modeling and Supervisory Control of Railway Networks Using Petri Nets
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
Alessandro Giua, Carla Seatzu
ASPDAC
2005
ACM
123views Hardware» more  ASPDAC 2005»
14 years 2 months ago
Comparing high-level modeling approaches for embedded system design
- This paper presents a comparison between three different high-level modeling approaches for embedded systems design, focusing on systems that require dataflow models. The propose...
Lisane B. de Brisolara, Leandro Buss Becker, Luigi...
FSTTCS
2010
Springer
13 years 6 months ago
Global Model Checking of Ordered Multi-Pushdown Systems
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
Mohamed Faouzi Atig