198 search results - page 33 / 40 » Extended Temporal Logic Revisited |
AIPS
2009
15 years 26 days ago
2009
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
118
click to vote
FORMATS
2004
Springer
15 years 5 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
107
click to vote
BIRTHDAY
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. This article provides an overview over two constructive approaches to provably correct hard real-time code generation where hard real-time code is generated from abstract...
122
click to vote
APLAS
2007
ACM
2007
ACM
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer
15 years 3 months ago
We rationally reconstruct the core of the Coccinelle system, used for automating and documenting collateral evolutions in Linux device drivers. A denotational semantics of the syst...
106
click to vote
ATVA
2006
Springer
15 years 3 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...