1705 search results - page 31 / 341 » Representing Constraints with Automata |
FORMATS
2004
Springer
13 years 11 months ago
2004
Springer
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
ICWS
2007
IEEE
13 years 9 months ago
2007
IEEE
We study the problem of synthesis of a choreogrpher in Web service composition for a given set of services and a goal. Services and goal are represented using i/o automata which c...
SPIN
2010
Springer
13 years 6 months ago
2010
Springer
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
CONCUR
2012
Springer
11 years 10 months ago
2012
Springer
Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks. This is a problem ...