Synchronous Programming of Reactive SystemsSpringer Science & Business Media, 29/06/2013 - 174 من الصفحات This book will attempt to give a first synthesis of recent works con cerning reactive system design. The term "reactive system" has been introduced in order to at'oid the ambiguities often associated with by the term "real-time system," which, although best known and more sugges tive, has been given so many different meanings that it is almost in evitably misunderstood. Industrial process control systems, transporta tion control and supervision systems, signal-processing systems, are ex amples of the systems we have in mind. Although these systems are more and more computerized, it is sur prising to notice that the problem of time in computer science has been studied only recently by "pure" computer scientists. Until the early 1980s, time problems were regarded as the concern of performance evalu ation, or of some (unjustly scorned) "industrial computer engineering," or, at best, of operating systems. A second surprising fact, in contrast, is the growth of research con cerning timed systems during the last decade. The handling of time has suddenly become a fundamental goal for most models of concurrency. In particular, Robin Alilner 's pioneering works about synchronous process algebras gave rise to a school of thought adopting the following abstract point of view: As soon as one admits that a system can instantaneously react to events, i. e. |
المحتوى
Static verifications | 5 |
The imperative language Esterel | 11 |
the reflex game | 31 |
the language Argos | 39 |
Lustre and Signal | 53 |
Sequential code generation | 85 |
Compiling LUSTRE into automata | 96 |
Distributed code generation | 103 |
1 | 117 |
9 | 139 |
171 | |
طبعات أخرى - عرض جميع المقتطفات
Synchronous Programming of Reactive Systems <span dir=ltr>Nicolas Halbwachs</span> لا تتوفر معاينة - 2010 |
Synchronous Programming of Reactive Systems <span dir=ltr>Nicolas Halbwachs</span> لا تتوفر معاينة - 2014 |
عبارات ومصطلحات مألوفة
_pre_remaining_delay alarm ARGOS array assertion automata automaton await basic clock behavior bisimulation bool BUTTON_2 causality causality loop cell checking circuit computed considered constraints coroutine corresponding cycle data-flow declaration defined delay distributed code emission emit LAP end end equations ESTEREL compiler ESTEREL program example execution exit Figure finite FLIP flip-flop formal verification frozen FROZEN_TIME GO lamp goto S2 goto STATE2 graph Grenoble Halt register halt watching hardware implemented INIT initial input events input signals input/output instance integer interface internal_time leftmost LIFT STOPPED loop LUSTRE program millisecond Model checking module node nondeterminism occurs OPEN DOOR_COMMAND operator output parallel composition parameters present program verification reaction reactive systems real-time remaining_delay reset running semantics sequence of values sequential code START_STOP stat stopwatch STOPWATCH_RUNNING subprocess synchronous languages synchronous programming SYNDEX termination tick timeout transition transition table translation tuple variables watchdog watchdog_is_on watching statement wires