Sciweavers

7311 search results - page 283 / 1463
» Time in State Machines
Sort
View
CIE
2007
Springer
16 years 1 months ago
The Complexity of Quickly ORM-Decidable Sets
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...
Joel David Hamkins, David Linetsky, Russell G. Mil...
APN
2006
Springer
15 years 11 months ago
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
Thomas Chatain, Claude Jard
UAI
2008
15 years 8 months ago
Sensitivity analysis for finite Markov chains in discrete time
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering a...
Gert De Cooman, Filip Hermans, Erik Quaeghebeur
CSDA
2008
62views more  CSDA 2008»
15 years 7 months ago
Waiting time distribution of generalized later patterns
In this paper the concept of later waiting time distributions for patterns in multi-state trials is generalized to cover a collection of compound patterns that must all be counted...
Donald E. K. Martin, John A. D. Aston
CDC
2010
IEEE
109views Control Systems» more  CDC 2010»
15 years 2 months ago
On-line optimal timing control of switched systems
This paper considers a real-time algorithm for performance optimization of switched-mode hybrid dynamical systems. The controlled parameter consists of the switching times between ...
Yorai Wardi, Philip Twu, Magnus Egerstedt