Sciweavers

231 search results - page 31 / 47
» Symbolic Model Checking for Event-Driven Real-Time Systems
Sort
View
159
Voted
CONCUR
1997
Springer
15 years 7 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler
131
Voted
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
15 years 1 months ago
A probabilistic approach for control of a stochastic system from LTL specifications
We consider the problem of controlling a continuous-time linear stochastic system from a specification given as a Linear Temporal Logic (LTL) formula over a set of linear predicate...
Morteza Lahijanian, Sean B. Andersson, Calin Belta
137
Voted
ACSD
2008
IEEE
102views Hardware» more  ACSD 2008»
15 years 10 months ago
Performing causality analysis by bounded model checking
Synchronous systems can immediately react to the inputs of their environment which may lead to so-called causality cycles between actions and their trigger conditions. Systems wit...
Klaus Schneider, Jens Brandt
LICS
2003
IEEE
15 years 8 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
143
Voted
IANDC
2007
107views more  IANDC 2007»
15 years 3 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...