Sciweavers

101 search results - page 5 / 21
» A New Class of Decidable Hybrid Systems
Sort
View
IEEECIT
2009
IEEE
14 years 1 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi
ASM
2004
ASM
14 years 11 days ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
HYBRID
2009
Springer
14 years 1 months ago
Periodically Controlled Hybrid Systems
Abstract. This paper introduces Periodically Controlled Hybrid Automata (PCHA) for describing a class of hybrid control systems. In a PCHA, control actions occur roughly periodical...
Tichakorn Wongpiromsarn, Sayan Mitra, Richard M. M...
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
FORMATS
2005
Springer
14 years 15 days ago
Reachability Problems on Extended O-Minimal Hybrid Automata
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
Raffaella Gentilini