منابع مشابه
Partial Observation in Distributed Supervisory Control of Discrete-Event Systems
Distributed supervisory control is a method to synthesize local controllers in discrete-eventsystems with a systematic observation of the plant. Some works were reported on extending this methodby which local controllers are constructed so that observation properties are preserved from monolithic todistributed supervisory control, in an up-down approach. In this paper, we find circumstances in ...
متن کاملA Distributed Event Calculus for Event Recognition
Events provide a fundamental abstraction for representing time-evolving information. Complex event recognition focuses on tracking and analysing streams of events, in order to detect patterns of special significance. The event streams may originate from various types of sensor, such as cameras and GPS sensors. Furthermore, the stream velocity and volume pose significant challenges to event proc...
متن کاملEvent Models in Distributed Event Based Systems
Applications are regularly developed by composing functionality encapsulated in units of computation. Depending on the type of system these units of computation, components for short, include modules, classes, and programs. The functionality provided by components can be composed by procedural abstraction and implicit invocation (Garlan & Shaw, 1994; Dingel et al., 1998; Notkin et al., 1993). W...
متن کاملDistributed Event-Based Computing
As computing systems get larger in capability a good thing they also get larger in ways less desirable: cost, volume, power requirements and so on. Further, as the datastructures necessary to support large computations grow physically, the proportion of wallclock time spent communicating increases dramatically at the expense of the time spent calculating. This state of affairs is currently unac...
متن کاملDistributed Event Clock Automata
In distributed real-time systems, we cannot assume that clocks are perfectly synchronized. To model them, we borrow independent clocks from independent clocks timed automata (icTA). First, we define the timed universal and existential semantics icTA. The emptiness of universal timed language of an icTA, and the timed language inclusion of icTA are undecidable. To recover decidability, we propos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1992
ISSN: 0022-0000
DOI: 10.1016/0022-0000(92)90011-7