570 search results - page 9 / 114 » Robustness and Implementability of Timed Automata |
89
Voted
FORMATS
2006
Springer
15 years 3 months ago
2006
Springer
Using a variant of Clariso-Cortadella's parametric method for verifying asynchronous circuits, we formally derive a set of linear constraints that ensure the correctness of so...
ENTCS
2008
14 years 11 months ago
2008
Given a timed automaton with parametric timings, our objective is to describe a procedure for deriving constraints on the parametric timings in order to ensure that, for each valu...
105
click to vote
FORMATS
2009
Springer
15 years 3 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
HYBRID
2010
Springer
14 years 9 months ago
2010
Springer
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
82
Voted
FUIN
2008
14 years 11 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...