Sciweavers

168 search results - page 30 / 34
» Temporal Logic with Capacity Constraints
Sort
View
HYBRID
1997
Springer
14 years 3 months ago
Robust Timed Automata
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
Vineet Gupta, Thomas A. Henzinger, Radha Jagadeesa...
SPLC
2008
14 years 11 days ago
Formal Modeling for Product Families Engineering
In this paper we propose a behavioural model, namely the Generalized Extended Modal Transition Systems, as a basis for the formalization of different notions of variability usuall...
Alessandro Fantechi, Stefania Gnesi
TIME
2009
IEEE
14 years 5 months ago
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
Luke Hunsberger
ECAI
2010
Springer
13 years 9 months ago
LTL Goal Specifications Revisited
The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the seman...
Andreas Bauer 0002, Patrik Haslum
SIGMETRICS
1998
ACM
114views Hardware» more  SIGMETRICS 1998»
14 years 3 months ago
Generating Representative Web Workloads for Network and Server Performance Evaluation
One role for workload generation is as a means for understanding how servers and networks respond to variation in load. This enables management and capacity planning based on curr...
Paul Barford, Mark Crovella