20126 search results - page 137 / 4026 » Timed Transition Systems |
163
Voted
IANDC
2007
15 years 3 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
130
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We study the mixing time of some Markov Chains converging to critical physical models. These models are indexed by a parameter β and there exists some critical value βc where th...
127
Voted
FSTTCS
2004
Springer
15 years 8 months ago
2004
Springer
Priced timed (game) automata extend timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability priced timed game automata and prove ...
103
click to vote
AC
2003
Springer
15 years 8 months ago
2003
Springer
This chapter is to provide a tutorial and pointers to results and related work on timed automata with a focus on semantical and algorithmic aspects of verification tools. We prese...
116
Voted
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets ex...