58 search results - page 6 / 12 » When Are Timed Automata Weakly Timed Bisimilar to Time Petri... |
ITCC
2003
IEEE
14 years 24 days ago
2003
IEEE
A multimedia server needs to satisfy the temporal ordering of multimedia data streams when servicing a client. Multimedia data has high bandwidth requirements, and within a networ...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
APN
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
ENTCS
2006
13 years 7 months ago
2006
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
FORMATS
2003
Springer
14 years 22 days ago
2003
Springer
We present a process algebra suitable to the modelling of timed concurrent systems and to their efficient verification through model checking. The algebra is provided with two con...