Download Free A Temporal Logic For The Specification And Verification Of Real Time Systems Book in PDF and EPUB Free Download. You can read online A Temporal Logic For The Specification And Verification Of Real Time Systems and write the review.

The research described in this monograph concerns the formal specification and compositional verification of real-time systems. A real-time programminglanguage is considered in which concurrent processes communicate by synchronous message passing along unidirectional channels. To specifiy functional and timing properties of programs, two formalisms are investigated: one using a real-time version of temporal logic, called Metric Temporal Logic, and another which is basedon extended Hoare triples. Metric Temporal Logic provides a concise notationto express timing properties and to axiomatize the programming language, whereas Hoare-style formulae are especially convenient for the verification of sequential constructs. For both approaches a compositional proof system has been formulated to verify that a program satisfies a specification. To deduce timing properties of programs, first maximal parallelism is assumed, modeling the situation in which each process has itsown processor. Next, this model is generalized to multiprogramming where several processes may share a processor and scheduling is based on priorities. The proof systems are shown to be sound and relatively complete with respect to a denotational semantics of the programming language. The theory is illustrated by an example of a watchdog timer.
The research described in this monograph concerns the formal specification and compositional verification of real-time systems. A real-time programminglanguage is considered in which concurrent processes communicate by synchronous message passing along unidirectional channels. To specifiy functional and timing properties of programs, two formalisms are investigated: one using a real-time version of temporal logic, called Metric Temporal Logic, and another which is basedon extended Hoare triples. Metric Temporal Logic provides a concise notationto express timing properties and to axiomatize the programming language, whereas Hoare-style formulae are especially convenient for the verification of sequential constructs. For both approaches a compositional proof system has been formulated to verify that a program satisfies a specification. To deduce timing properties of programs, first maximal parallelism is assumed, modeling the situation in which each process has itsown processor. Next, this model is generalized to multiprogramming where several processes may share a processor and scheduling is based on priorities. The proof systems are shown to be sound and relatively complete with respect to a denotational semantics of the programming language. The theory is illustrated by an example of a watchdog timer.
Specification [--] We present two conservative extensions of temporal logic that allow for the specification of timing constraints: while timed temporal logic provides access to time through a novel kind of time quantifier, metric temporal logic refers to time through time-bounded versions of the temporal operators. We justify our choice of specification languages by developing a general framework for the classification of real-time logics according to their complexity and expressive power.
Pt. I. Real time systems - background. 1. Real time system characteristics. 1.1. Real-time and reactive programs. 2. Formal program development methodologies. 2.1. Requirement specification. 2.2. System specifications. 3. Characteristics of real-time languages. 3.1. Modelling features of real-time languages. 3.2. A look at classes of real-time languages. 4. Programming characteristics of reactive systems. 4.1. Execution of reactive programs. 4.2. Perfect synchrony hypothesis. 4.3. Multiform notion of time. 4.4. Logical concurrency and broadcast communication. 4.5. Determinism and causality -- pt. II. Synchronous languages. 5. ESTEREL language : structure. 5.1. Top level structure. 5.2. ESTEREL statements. 5.3. Illustrations of ESTEREL program behaviour. 5.4. Causality problems. 5.5. A historical perspective. 6. Program development in ESTEREL. 6.1. A simulation environment. 6.2. Verification environment. 7. Programming controllers in ESTEREL. 7.1. Auto controllers. 8. Asynchronous interaction in ESTEREL -- 9. Futurebus arbitration protocol : a case study. 9.1. Arbitration process. 9.2. Abstraction of the protocol. 9.3. Solution in ESTEREL -- 10. Semantics of ESTEREL. 10.1. Semantic structure. 10.2. Transition rules. 10.3. Illustrative examples. 10.4. Discussions. 10.5. Semantics of Esterel with exec -- pt. III. Other synchronous languages. 11. Synchronous language LUSTRE. 11.1. An overview of LUSTRE. 11.2. Flows and streams. 11.3. Equations, variables and expressions. 11.4. Program structure. 11.5. Arrays in LUSTRE. 11.6. Further examples. 12. Modelling Time-Triggered Protocol (TTP) in LUSTRE. 12.1. Time-triggered protocol. 12.2. Modelling TTP in LUSTRE. 13. Synchronous language ARGOS. 13.1. ARGOS constructs. 13.2. Illustrative example. 13.3. Discussions -- pt. IV. Verification of synchronous programs. 14. Verification of ESTEREL programs. 14.1. Transition system based verificationy of ESTEREL Programs. 14.2. ESTEREL transition system. 14.3. Temporal logic based verification. 14.4. Observer-based verification. 14.5. First order logic based verification. 15. Observer based verification of simple LUSTRE programs. 15.1. A simple auto controller. 15.2. A complex controller. 15.3. A cruise controller. 15.4. A train controller. 15.5. A mine pump controller -- pt. V. Integration of synchrony and asynchrony. 16. Communicating reactive processes. 16.1. An overview of CRP. 16.2. Communicating reactive processes : structure. 16.3. Behavioural semantics of CRP. 16.4. An illustrative example : banker teller machine. 16.5. Implementation of CRP. 17. Semantics of communicating reactive processes. 17.1. A brief overview of CSP. 17.2. Translation of CSP to CRP. 17.3. Cooperation of CRP nodes. 17.4. Ready-trace semantics of CRP. 17.5. Ready-trace semantics of CSP. 17.6. Extracting CSP ready-trace semantics from CRP semantics. 17.7. Correctness of the translation. 17.8. Translation into MEIJE process calculus. 18. Communicating reactive state machines. 18.1. CRSM constructs. 18.2. Semantics of CRSM. 19. Multiclock ESTEREL. 19.1. Need for a multiclock synchronous paradigm. 19.2. Informal introduction. 19.3. Formal semantics. 19.4. Embedding CRP. 19.5. Modelling a VHDL subset. 19.6. Discussion. 20. Modelling real-time systems in ESTEREL. 20.1. Interpretation of a global clock in terms of exec. 20.2. Modelling real-time requirements. 21. Putting it together
This text provides an account of real-time systems. The presentation makes use of recent research demonstrating the effectiveness and applicability of mathematically-based methods for real-time system design. Each chapter focuses on a particular technique, and examples help reinforce the theory.
The name "temporal logic" may sound complex and daunting; but while they describe potentially complex scenarios, temporal logics are often based on a few simple, and fundamental, concepts - highlighted in this book. An Introduction to Practical Formal Methods Using Temporal Logic provides an introduction to formal methods based on temporal logic, for developing and testing complex computational systems. These methods are supported by many well-developed tools, techniques and results that can be applied to a wide range of systems. Fisher begins with a full introduction to the subject, covering the basics of temporal logic and using a variety of examples, exercises and pointers to more advanced work to help clarify and illustrate the topics discussed. He goes on to describe how this logic can be used to specify a variety of computational systems, looking at issues of linking specifications, concurrency, communication and composition ability. He then analyses temporal specification techniques such as deductive verification, algorithmic verification, and direct execution to develop and verify computational systems. The final chapter on case studies analyses the potential problems that can occur in a range of engineering applications in the areas of robotics, railway signalling, hardware design, ubiquitous computing, intelligent agents, and information security, and explains how temporal logic can improve their accuracy and reliability. Models temporal notions and uses them to analyze computational systems Provides a broad approach to temporal logic across many formal methods - including specification, verification and implementation Introduces and explains freely available tools based on temporal logics and shows how these can be applied Presents exercises and pointers to further study in each chapter, as well as an accompanying website providing links to additional systems based upon temporal logic as well as additional material related to the book.
This volume constitutes the proceedings of the First International Conference on Temporal Logic (ICTL '94), held at Bonn, Germany in July 1994. Since its conception as a discipline thirty years ago, temporal logic is studied by many researchers of numerous backgrounds; presently it is in a stage of accelerated dynamic growth. This book, as the proceedings of the first international conference particularly dedicated to temporal logic, gives a thorough state-of-the-art report on all aspects of temporal logic research relevant for computer science and AI. It contains 27 technical contributions carefully selected for presentation at ICTL '94 as well as three surveys and position papers.
Providing a framework for modelling, specifying and verifying systems composed of real-time discrete event processes, this text combines a formal framework in computer science with applications in software and control engineering.