Titlebook: Real-Time: Theory in Practice; REX Workshop, Mook, J. W. Bakker,C. Huizing,G. Rozenberg Conference proceedings 1992 Springer-Verlag Berlin

關(guān)節(jié)炎

jaunty

Problems, promises and performance: some questions for real-time system specification, of time external to the program, the representation of time in the program and the verification of the timing properties on an implementation. Three different views are compared: real-time programming without time, the synchrony hypothesis and asynchronous real-time programs. Questions about the re

支形吊燈

Abstraction in real time process algebra,of which the soundness and the completeness is proven. By adding the integral construct we can interpret symbolic (untimed) process terms as timed processes. We investigate the resulting .-equivalence and come to a delay bisimulation with a stronger root condition. Finally we test the applicability

兩棲動物

(Real) time: A philosophical perspective,f time that does not consider quantitative timing issues such as those relevant for real-time computing. This starting point is then adapted to incorporate real-time features. In doing so we try to combine the views on time and real-time forwarded by mathematical logic and by computer science. To il

夾死提手勢

委派

Forward and backward simulations for timing-based systems, such systems. As a first step, a comprehensive overview of simulation techniques for simple untimed automata is given. In particular, soundness and completeness results for (1) refinements, (2) forward and backward simulations, (3) forward-backward and backward-forward simulations, and (4) history

儀式

GROVE

價值在貶值

Compositional verification of real-time systems using extended Hoare triples,mal parallelism assumption which represents the situation in which each process has its own processor. Next this framework is generalized to multiprogramming where several processes may share a single processor and scheduling is based on priorities of statements.

有害

Specification and analysis of resource-bound real-time systems,putation model by a prioritysensitive, operational semantics, which yields a set of equivalence-preserving proof rules. Using this proof system, we perform the algebraic verification of our original real-time system.