Sciweavers

2850 search results - page 74 / 570
» On Timed Models and Full Abstraction
Sort
View
FOSSACS
2009
Springer
16 years 29 days ago
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
Parosh Aziz Abdulla, Richard Mayr
SIAMCO
2008
83views more  SIAMCO 2008»
15 years 6 months ago
Necessary Conditions for Multiobjective Optimal Control Problems with Free End-Time
Abstract. Necessary conditions of optimality are derived for multiobjective optimal control problems with free end-time, in which the dynamics constraint is modeled as a nonconvex ...
B. T. Kien, N.-C. Wong, J. C. Yao
EUROPAR
2003
Springer
15 years 11 months ago
Replicated Placements in the Polyhedron Model
Abstract. Loop-carried code placement (LCCP) is able to remove redundant computations that cannot be recognized by traditional code motion techniques. However, this comes possibly ...
Peter Faber, Martin Griebl, Christian Lengauer
SIGADA
2005
Springer
15 years 11 months ago
Temporal skeletons for verifying time
This paper presents an intermediate notation used in a framework for verification of real-time properties. The framework aims at overcoming the need for the framework user to hav...
Gustaf Naeser, Kristina Lundqvist, Lars Asplund
JUCS
2008
162views more  JUCS 2008»
15 years 6 months ago
Composition and Run-time Adaptation of Mismatching Behavioural Interfaces
Abstract: Reuse of software entities such as components or Web services raise composition issues since, most of the time, they present mismatches in their interfaces. These mismatc...
Javier Cámara, Gwen Salaün, Carlos Can...