Sciweavers

1105 search results - page 110 / 221
» Timed Automata Model for Component-Based Real-Time Systems
Sort
View
IPL
2007
125views more  IPL 2007»
15 years 6 months ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston
CAV
1994
Springer
113views Hardware» more  CAV 1994»
15 years 10 months ago
A Determinizable Class of Timed Automata
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
Rajeev Alur, Limor Fix, Thomas A. Henzinger
FORMATS
2003
Springer
15 years 11 months ago
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
AGENTS
1997
Springer
15 years 10 months ago
Story-Making with Improvisational Puppets
"Improv Puppets'' is an interaction paradigm modeled after traditional puppet play. With physical puppets, children move their puppets' bodies and speak their ...
Barbara Hayes-Roth, Robert van Gent
ENTCS
2007
156views more  ENTCS 2007»
15 years 6 months ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...