585 search results - page 15 / 117 » Better Abstractions for Timed Automata |
187
click to vote
FAABS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The design of reactive systems must comply with logical correctness (the system does what it is supposed to do) and timeliness (the system has to satisfy a set of tempora...
118
Voted
HYBRID
2007
Springer
15 years 7 months ago
2007
Springer
A notion of diagnosability for hybrid systems is defined, which generalizes the notion of observability. We verify bility properties on a timed automaton abstraction of the origina...
141
Voted
CONCUR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
124
Voted
SOFSEM
2009
Springer
16 years 14 days ago
2009
Springer
Abstract. We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-...
138
Voted
FUIN
2010
15 years 28 days ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...