585 search results - page 31 / 117 » Better Abstractions for Timed Automata |
114
click to vote
CDC
2008
IEEE
15 years 2 months ago
2008
IEEE
Abstract-- The dynamics of exploration vs exploitation decisions are explored in the context of robotic search problems. Building on prior work on robotic search together with our ...
105
click to vote
QEST
2010
IEEE
14 years 10 months ago
2010
IEEE
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
104
Voted
ACSD
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--The ANR project SPaCIFY develops a domainspecific programming environment, Synoptic, to engineer embedded software for space applications. Synoptic is an Eclipse-based mo...
92
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
133
click to vote
CONCUR
2006
Springer
15 years 2 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...