1246 search results - page 16 / 250 » Recursive Timed Automata |
FSTTCS
2005
Springer
14 years 28 days ago
2005
Springer
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
FUIN
2008
13 years 7 months ago
2008
Abstract. Communicating Hierarchical Transaction-based Timed Automata have been introduced to model systems performing long
IANDC
2008
13 years 7 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
FORMATS
2005
Springer
14 years 28 days ago
2005
Springer
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
JLP
2006
13 years 7 months ago
2006
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpreta...