Sciweavers

3750 search results - page 18 / 750
» Timed Automata Patterns
Sort
View
IPL
2007
125views more  IPL 2007»
13 years 7 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
FUIN
2008
108views more  FUIN 2008»
13 years 7 months ago
Radial View of Continuous Cellular Automata
Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function...
Paola Flocchini, Vladimir Cezar
CAV
2000
Springer
141views Hardware» more  CAV 2000»
13 years 12 months ago
Binary Reachability Analysis of Discrete Pushdown Timed Automata
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
Zhe Dang, Oscar H. Ibarra, Tevfik Bultan, Richard ...
FORMATS
2007
Springer
14 years 1 months ago
Undecidability of Universality for Timed Automata with Minimal Resources
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
Sara Adams, Joël Ouaknine, James Worrell
ASWEC
2007
IEEE
14 years 1 months ago
Timed Behavior Trees and Their Application to Verifying Real-Time Systems
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
Lars Grunske, Kirsten Winter, Robert Colvin