Sciweavers

108 search results - page 13 / 22
» Hybrid Transitive Closure Algorithms
Sort
View
CSL
2008
Springer
14 years 11 months ago
Syntactic Metatheory of Higher-Order Subtyping
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
Andreas Abel, Dulma Rodriguez
HYBRID
2003
Springer
15 years 2 months ago
Qualitative Heterogeneous Control of Higher Order Systems
This paper presents the qualitative heterogeneous control framework, a methodology for the design of a controlled hybrid system based on attractors and transitions between them. Th...
Subramanian Ramamoorthy, Benjamin Kuipers
RTSS
1998
IEEE
15 years 1 months ago
Membership Questions for Timed and Hybrid Automata
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan
HYBRID
2007
Springer
15 years 1 months ago
Solving Coverage Problems with Embedded Graph Grammars
We show how Embedded Graph Grammars (EGGs) are used to specify local interaction rules between mobile robots in a natural manner. This formalism allows us to treat local network to...
John-Michael McNew, Eric Klavins, Magnus Egerstedt
ICSM
2008
IEEE
15 years 4 months ago
Dynamic slicing of multithreaded programs for race detection
Prior work has shown that computing dynamic slices of erroneous program values can greatly assist in locating the root cause of erroneous behavior by identifying faulty statements...
Sriraman Tallam, Chen Tian, Rajiv Gupta