Modeling and Verification of Real time Systems 1st Edition by Nicolas Navet, Stephan Merz ISBN 978-1118624098 1118624098
Original price was: $50.00.$35.00Current price is: $35.00.
Modeling and Verification of Real time Systems 1st Edition by Nicolas Navet, Stephan Merz – Ebook PDF Instant Download/Delivery: 978-1118624098, 1118624098
Full download Modeling and Verification of Real time Systems 1st Edition after payment
Product details:
ISBN 10: 1118624098
ISBN 13: 978-1118624098
Author: Nicolas Navet, Stephan Merz
This title is devoted to presenting some of the most important concepts and techniques for describing real-time systems and analyzing their behavior in order to enable the designer to achieve guarantees of temporal correctness.
Topics addressed include mathematical models of real-time systems and associated formal verification techniques such as model checking, probabilistic modeling and verification, programming and description languages, and validation approaches based on testing. With contributions from authors who are experts in their respective fields, this will provide the reader with the state of the art in formal verification of real-time systems and an overview of available software tools.
Table of contents:
Chapter 1. Time Petri Nets – Analysis Methods and Verification with TINA
Bernard BERTHOMIEU, Florent PERES and François VERNADAT
1.1. Introduction
1.2. Time Petri nets
1.2.1. Definition
1.2.2. States and the state reachability relation
1.2.3. Illustration
1.2.4. Some general theorems
1.3. State class graphs preserving markings and LTL properties
1.3.1. State classes
1.3.2. Illustration
1.3.3. Checking the boundedness property on-the-fly
1.3.4. Variations
1.3.4.1. Multiple enabledness
1.3.4.2. Preservation of markings (only)
1.4. State class graphs preserving states and LTL properties
1.4.1. Clock domain
1.4.2. Construction of the SSCG
1.4.3. Variants
1.5. State class graphs preserving states and branching properties
1.6. Computing firing schedules
1.6.1. Schedule systems.
1.6.2. Delays (relative dates) versus dates (absolute)
1.6.3. Illustration
1.7. An implementation: the Tina environment
1.8. The verification of SE-LTL formulae in Tina
1.8.1. The temporal logic SE-LTL
1.8.2. Preservation of LTL properties by tina constructions
1.8.3. selt: the SE-LTL checker of Tina
1.8.3.1. Verification technique
1.8.3.2. The selt logic
1.9. Some examples of use of selt
1.9.1. John and Fred.
1.9.1.1. Statement of problem
1.9.1.2. Are the temporal constraints appearing in this scenario consistent?
1.9.1.3. Is it possible that Fred took the bus and John the carpool?.
1.9.1.4. At which time could Fred have left home?
1.9.2. The alternating bit protocol
1.10. Conclusion.
1.11. Bibliography
Chapter 2. Validation of Reactive Systems by Means of Verification and Conformance Testing
Camille Constant, Thierry Jeron, Hervé Marchand and Vlad Rusu
2.1. Introduction
2.2. The IOSTS model
2.2.1. Syntax of IOSTS
2.2.2. Semantics of IOSTS
2.3. Basic operations on IOSTS
2.3.1. Parallel product
2.3.2. Suspension
2.3.3. Deterministic IOSTS and determinization
2.4. Verification and conformance testing with IOSTS
2.4.1. Verification
2.4.1.1. Verifying safety properties
2.4.1.2. Verifying possibility properties
2.4.1.3. Combining observers
2.4.2. Conformance testing
2.5. Test generation
2.6. Test selection
2.7. Conclusion and related work
2.8. Bibliography
Chapter 3. An Introduction to Model Checking
Stephan MERZ
3.1. Introduction
3.2. Example: control of an elevator
5.5. Transition systems and invariant checking
3.3.1. Transition systems and their runs
3.3.2. Verification of invariants.
3.4. Temporal logic
3.4.1. Linear-time temporal logic
3.4.2. Branching-time temporal logic
3.4.3. in-automata
3.4.4. Automata and PTL
3.5. Model checking algorithms
3.5.1. Local PTL model checking
3.5.2. Global CTL model checking
3.5.3. Symbolic model checking algorithms
3.6. Some research topics
3.7. Bibliography
Chapter 4. Model Checking Timed Automata
Patricia BOUYER and François LAROUSSINIE
4.1. Introduction
4.2. Timed automata
4.2.1. Some notations
4.2.2. Timed automata, syntax and semantics
4.2.3. Parallel composition
4.3. Decision procedure for checking reachability
4.4. Other verification problems
4.4.1. Timed languages
4.4.2. Branching-time timed logics
4.4.3. Linear-time timed logics.
4.4.4. Timed modal logics
4.4.5. Testing automata
4.4.6. Behavioral equivalences
4.5. Some extensions of timed automata
4.5.1. Diagonal clock constraints
4.5.2. Additive clock constraints
4.5.3. Internal actions
4.5.4. Updates of clocks
4.5.5. Linear hybrid automata
4.6. Subclasses of timed automata
4.6.1. Event-recording automata
4.6.2. One-clock timed automata.
4.6.3. Discrete-time models
4.7. Algorithms for timed verification
4.7.1. A symbolic representation for timed automata: the zones
4.7.2. Backward analysis in timed automata
4.7.3. Forward analysis of timed automata
4.7.4. A data structure for timed systems: DBMS
4.8. The model-checking tool Uppaal.
4.9. Bibliography
Chapter 5. Specification and Analysis of Asynchronous Systems
using CADP
Radu MATEESCU
5.1. Introduction
5.2. The CADP toolbox
5.2.1. The LOTOS language
5.2.2. Labeled transition systems
5.2.3. Some verification tools
5.3. Specification of a drilling
unit.
5.3.1. Architecture.
5.3.2. Physical devices and local controllers
5.3.2.1. Turning table
5.3.2.2. Clamp
5.3.2.3. Drill
5.3.2.4. Tester
5.3.3. Main controller – sequential version
5.3.4. Main controller – parallel version
5.3.5. Environment
5.4. Analysis of the functioning of the drilling unit
5.4.1. Equivalence checking
5.4.2. Model checking
5.5. Conclusion and future work
5.6. Bibliography
Chapter 6. Synchronous Program Verification with Lustre/Lesar
Pascal RAYMOND
6.1. Synchronous approach.
6.1.1. Reactive systems
6.1.2. The synchronous approach
6.1.3. Synchronous languages
6.2. The Lustre language
6.2.1. Principles
6.2.2. Example: the beacon counter
6.3. Program verification
6.3.1. Notion of temporal property
6.3.2. Safety and liveness
6.3.3. Beacon counter properties
6.3.4. State machine
6.3.5. Explicit automaton
6.3.6. Principles of model checking
6.3.7. Example of abstraction
6.3.8. Conservative abstraction and safety
6.4. Expressing properties
6.4.1. Model checking: general scheme
6.4.2. Model checking synchronous program
6.4.3. Observers
6.4.4. Examples
6.4.5. Hypothesis
6.4.6. Model checking of synchronous programs
6.5. Algorithms
6.5.1. Boolean automaton
6.5.2. Explicit automaton
6.5.3. The “pre” and “post” functions
6.5.4. Outstanding states
6.5.5. Principles of the exploration
6.6. Enumerative algorithm
6.7. Symbolic methods and binary decision diagrams
6.7.1. Notations
6.7.2. Handling predicates
6.7.3. Representation of the predicates
6.7.3.1. Shannon’s decomposition
6.7.3.2. Binary decision diagrams
6.7.4. Typical interface of a BDD library
6.7.5. Implementation of BDDs
6.7.6. Operations on BDDs
6.7.6.1. Negation
6.7.6.2. Binary operators
6.7.6.3. Cofactors and quantifiers
6.7.7. Notes on complexity
6.7.8. Typed decision diagrams
6.7.8.1. Positive functions
6.7.8.2. TDG
6.7.8.3. TDG implementation
6.7.8.4. Interest in TDGs
6.7.9. Care set and generalized cofactor.
6.7.9.1. “Knowing that” operators
6.7.9.2. Generalized cofactor
6.7.9.3. Restriction
6.7.9.4. Algebraic properties of the generalized cofactor
6.8. Forward symbolic exploration.
6.8.1. General scheme.
6.8.2. Detailed implementation.
6.8.3. Symbolic image computing
6.8.4. Optimized image computing
6.8.4.1. Principles
6.8.4.2. Universal image
6.8.4.3. Case of a single transition function.
6.8.4.4. Shannon’s decomposition of the image
6.9. Backward symbolic exploration.
6.9.1. General scheme.
6.9.2. Reverse image computing
6.9.3. Comparing forward and backward methods
6.10. Conclusion and related works
6.11. Demonstrations
6.12. Bibliography
Chapter 7. Synchronous Functional Programming with Lucid Synchrone
Paul CASPI, Grégoire HAMON and Marc POUZET
7.1. Introduction
7.1.1. Programming reactive systems
7.1.1.1. The synchronous languages
7.1.1.2. Model-based design
7.1.1.3. Converging needs
7.1.2. Lucid Synchrone
7.2. Lucid Synchrone
7.2.1. An ML dataflow language.
7.2.1.1. Infinite streams as basic objects
7.2.1.2. Temporal operations: delay and initialization
7.2.2. Stream functions
7.2.3. Multi-sampled systems
7.2.3.1. The sampling operator when
7.2.3.2. The combination operator merge
7.2.3.3. Oversampling.
7.2.3.4. Clock constraints and synchrony
7.2.4. Static values
7.2.5. Higher-order features
7.2.6. Datatypes and pattern matching.
7.2.7. A programming construct to share the memory
7.2.8. Signals and signal patterns
7.2.8.1. Signals as clock abstractions
7.2.8.2. Testing presence and pattern matching over signals
7.2.9. State machines and mixed designs
7.2.9.1. Weak and strong preemption
7.2.9.2. ABRO and modular reset
7.2.9.3. Local definitions to a state
7.2.9.4. Communication between states and shared memory
7.2.9.5. Resume or reset a state
7.2.10. Parametrized state machines
7.2.11. Combining state machines and signals
7.2.12. Recursion and non-real-time features
7.2.13. Two classical examples.
7.2.13.1. The inverted pendulum.
7.2.13.2. A heater
7.3. Discussion.
7.3.1. Functional reactive programming and circuit description languages
7.3.2. Lucid Synchrone as a prototyping language
7.4. Conclusion
7.5. Acknowledgment
7.6. Bibliography
Chapter 8. Verification of Real-Time Probabilistic Systems
Marta KWIATKOWSKA, Gethin NORMAN, David PARKER and Jeremy SPROSTON
8.1. Introduction
8.2. Probabilistic timed automata
8.2.1. Preliminaries
8.2.2. Syntax of probabilistic timed automata
8.2.3. Modeling with probabilistic timed automata
8.2.4. Semantics of probabilistic timed automata
8.2.5. Probabilistic reachability and invariance
8.3. Model checking for probabilistic timed automata
8.3.1. The region graph
8.3.2. Forward symbolic approach.
8.3.2.1. Symbolic state operations
8.3.2.2. Computing maximum reachability probabilities
8.3.3. Backward symbolic approach.
8.3.3.1. Symbolic state operations
8.3.3.2. Probabilistic until
8.3.3.3. Computing maximum reachability probabilities
8.3.3.4. Computing minimum reachability probabilities.
8.3.4. Digital clocks
8.3.4.1. Expected reachability
8.3.4.2. Integral semantics
8.4. Case study: the IEEE FireWire root contention protocol
8.4.1. Overview
8.4.2. Probabilistic timed automata model
8.4.3. Model checking statistics
8.4.4. Performance analysis
8.5. Conclusion
8.6. Bibliography
Chapter 9. Verification of Probabilistic Systems Methods and Tools
Serge HADDAD and Patrice MOREAUX
9.1. Introduction
9.2. Performance evaluation of Markovian models.
9.2.1. A stochastic model of discrete event systems
9.2.2. Discrete-time Markov chains
9.2.2.1. Presentation
9.2.2.2. Transient and steady-state behaviors of DTMC
9.2.3. Continuous-time Markov chains
9.2.3.1. Presentation
9.2.3.2. Transient and steady-state behaviors of CTMC
9.3. High level stochastic models
9.3.1. Stochastic Petri nets with general distributions
9.3.1.1. Choice policy
9.3.1.2. Service policy
9.3.1.3. Memory policy
9.3.2. GLSPN with exponential distributions
9.3.3. Performance indices of SPN
9.3.4. Overview of models and methods in performance evaluation
9.3.5. The GreatSPN tool
9.3.5.1. Supported models
9.3.5.2. Qualitative analysis of Petri nets
9.3.5.3. Performance analysis of stochastic Petri nets
9.3.5.4. Software architecture
9.4. Probabilistic verification of Markov chains
9.4.1. Limits of standard performance indices
9.4.2. A temporal logic for Markov chains
9.4.3. Verification algorithms.
9.4.4. Overview of probabilistic verification of Markov chains
9.4.5. The ETMCC tool
9.4.5.1. Language of system models
9.4.5.2. Language of properties
9.4.5.3. Computed results.
9.4.5.4. Software architecture
9.5. Markov decision processes
9.5.1. Presentation of Markov decision processes
9.5.2. A temporal logic for Markov decision processes
9.5.3. Verification algorithms.
9.5.4. Overview of verification of Markov decision processes
9.5.5. The PRISM tool
9.5.5.1. Language of system
models.
9.5.5.2. Properties language
9.5.5.3. Computed results.
9.5.5.4. Software architecture
9.6. Bibliography
Chapter 10. Modeling and Verification of Real-Time Systems using the IF Toolset
Marius BOZGA, Susanne GRAF, Laurent MOUNIER and Iulian OBER
10.1. Introduction
10.2. Architecture
10.3. The IF notation
10.3.1. Functional features
10.3.2. Non-functional features
10.3.3. Expressing properties with observers
10.4. The IF tools
10.4.1. Core components
10.4.2. Static analysis.
10.4.3. Validation
10.4.4. Translating UML to IF
10.4.4.1. UML modeling
10.4.4.2. The principles of the mapping from UML to IF
10.5. An overview on uses of IF in case studies
10.6. Case study: the Ariane 5 flight program
10.6.1. Overview of the Ariane 5 flight program
10.6.2. Verification of functional properties
10.6.3. Verification of non-functional properties
10.6.4. Modular verification and abstraction
10.7. Conclusion.
10.8. Bibliography
Chapter 11. Architecture Description Languages: An Introduction to the SAE AADL
Anne-Marie DÉPLANCHE and Sébastien FAUCOU
11.1. Introduction
11.2. Main characteristics of the architecture description languages
11.3. ADLs and real-time systems
11.3.1. Requirement analysis
11.3.2. Architectural views
11.4. Outline of related works
11.5. The AADL language
11.5.1. An overview of the AADL
People also search for:
modeling and simulation verification validation and accreditation
model verification and validation
model verification and validation examples
modeling and testing an nr rf transmitter
modeling and simulation verification and validation
Tags: Nicolas Navet, Stephan Merz, Modeling and Verification, Real time