1355 search results - page 32 / 271 » Alternating Timed Automata over Bounded Time |
ICCAD
2005
IEEE
14 years 1 months ago
2005
IEEE
— Balanced truncation (BT) model order reduction (MOR) is known for its superior accuracy and computable error bounds. Balanced stochastic truncation (BST) is a particular BT pro...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
FORMATS
2010
Springer
13 years 5 months ago
2010
Springer
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
RTSS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
DEDS
1998
13 years 7 months ago
1998
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...