Sciweavers

7311 search results - page 348 / 1463
» Time in State Machines
Sort
View
DEDS
1998
152views more  DEDS 1998»
15 years 7 months ago
Timed Petri Nets in Hybrid Systems: Stability and Supervisory Control
In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in de...
Xenofon D. Koutsoukos, Kevin X. He, Michael D. Lem...
CJ
2010
131views more  CJ 2010»
15 years 5 months ago
Turning Back Time - What Impact on Performance?
Consistent with the divide-and-conquer approach to problem solving, a recursive result is presented in the domain of stochastic modelling that derives product-form solutions for t...
Peter G. Harrison
198
Voted
INFOCOM
2009
IEEE
16 years 2 months ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
Satyajayant Misra, Guoliang Xue, Dejun Yang
FM
2001
Springer
108views Formal Methods» more  FM 2001»
16 years 2 days ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
190
Voted
CSL
2008
Springer
15 years 9 months ago
An Infinite Automaton Characterization of Double Exponential Time
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
Salvatore La Torre, P. Madhusudan, Gennaro Parlato