921 search results - page 15 / 185 » On Interleaving in Timed Automata |
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
APN
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
1 Routers need buffers to store and forward packets, especially when there is network congestion. With current memory technology, neither the SRAM nor the DRAM alone is suitabl...
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...
HIPC
2009
Springer
13 years 5 months ago
2009
Springer
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...