732 search results - page 2 / 147 » Axiomatising timed automata |
ICFEM
2009
Springer
13 years 4 months ago
2009
Springer
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the descri...
ATVA
2010
Springer
13 years 7 months ago
2010
Springer
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This ...
ENTCS
2006
13 years 6 months ago
2006
This paper gives an overview of recent results concerning the modular derivation of (i) modal specification logics, (ii) notions of simulation together with logical characterisati...
HYBRID
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...