The Inverse Method: Parametric Verification of Real-time Unbedded Systems [NOOK Book]

Overview

This book introduces state-of-the-art verification techniques for real-time embedded systems, based on the inverse method for parametric timed automata. It reviews popular formalisms for the specification and verification of timed concurrent systems and, in particular, timed automata as well as several extensions such as timed automata equipped with stopwatches, linear hybrid automata and affine hybrid automata.
The inverse method is introduced, and its benefits for guaranteeing...

See more details below
The Inverse Method: Parametric Verification of Real-time Unbedded Systems

Available on NOOK devices and apps  
  • NOOK Devices
  • NOOK HD/HD+ Tablet
  • NOOK
  • NOOK Color
  • NOOK Tablet
  • Tablet/Phone
  • NOOK for Windows 8 Tablet
  • NOOK for iOS
  • NOOK for Android
  • NOOK Kids for iPad
  • PC/Mac
  • NOOK for Windows 8
  • NOOK for PC
  • NOOK for Mac
  • NOOK Study
  • NOOK for Web

Want a NOOK? Explore Now

NOOK Book (eBook)
$53.49
BN.com price
(Save 42%)$93.00 List Price
Note: This NOOK Book can be purchased in bulk. Please email us for more information.

Overview

This book introduces state-of-the-art verification techniques for real-time embedded systems, based on the inverse method for parametric timed automata. It reviews popular formalisms for the specification and verification of timed concurrent systems and, in particular, timed automata as well as several extensions such as timed automata equipped with stopwatches, linear hybrid automata and affine hybrid automata.
The inverse method is introduced, and its benefits for guaranteeing robustness in real-time systems are shown. Then, it is shown how an iteration of the inverse method can solve the good parameters problem for parametric timed automata by computing a behavioral cartography of the system. Different extensions are proposed particularly for hybrid systems and applications to scheduling problems using timed automata with stopwatches. Various examples, both from the literature and industry, illustrate the techniques throughout the book.
Various parametric verifications are performed, in particular of abstractions of a memory circuit sold by the chipset manufacturer ST-Microelectronics, as well as of the prospective flight control system of the next generation of spacecraft designed by ASTRIUM Space Transportation.

Contents:

1. Parametric Timed Automata.
2. The Inverse Method for Parametric Timed Automata.
3. The Inverse Method in Practice: Application to Case Studies.
4. Behavioral Cartography of Timed Automata.
5. Parameter Synthesis for Hybrid Automata.
6. Application to the Robustness Analysis of Scheduling Problems.
7. Conclusion and Perspectives.

Read More Show Less

Product Details

  • ISBN-13: 9781118569788
  • Publisher: Wiley, John & Sons, Incorporated
  • Publication date: 2/20/2013
  • Series: FOCUS Series
  • Sold by: Barnes & Noble
  • Format: eBook
  • Edition number: 1
  • File size: 3 MB

Table of Contents

PREFACE

ACKNOWLEDGMENTS

INTRODUCTION

I.1. Motivation

I.1.1. An example of asynchronous

I.2. The good parameters problem

I.3. Content and organization of the book

I.3.1. Content

I.3.2. Organization of the book

I.3.3. Acknowledgments

CHAPTER 1. PARAMETRIC TIMED AUTOMATA

1.1. Constraints on clocks and parameters

1.1.1. Clocks

1.1.2. Parameters

1.1.3. Constraints

1.2. Labeled transition systems

1.3. Timed automata

1.3.1. Syntax

1.3.2. Semantics

1.4. Parametric timed automata

1.4.1. Syntax

1.4.2. Semantics

1.5. Related work

1.5.1. Representation of time

1.5.2. Timed automata

1.5.3. Time Petri nets

1.5.4. Hybrid systems

CHAPTER 2. THE INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA

2.1. The inverse problem

2.1.1. A motivating example

2.1.2. The problem

2.2. The inverse method algorithm

2.2.1. Principle

2.2.2. A toy example

2.2.3. Remarks on the algorithm

2.2.4. Results

2.2.5. Discussion

2.3. Variants of the inverse method

2.3.1. Algorithm with state inclusion in the fixpoint

2.3.2. Algorithm with union of the constraints

2.3.3. Algorithm with simple return

2.3.4. Combination: inclusion in fixpoint and union

2.3.5. Combination: inclusion in fixpoint and direct return

2.3.6. Summary of the algorithms

2.4. Related work

2.4.1. History of the inverse method

2.4.2. Time-abstract bisimulation

2.4.3. Formal techniques of verification

2.4.4. Problems related to the inverse problem

2.4.5. Parameter synthesis for parametric timed automata

CHAPTER 3. THE INVERSE METHOD IN PRACTICE: APPLICATION TO CASE STUDIES

3.1. IMITATOR

3.1.1. History

3.1.2. Architecture and features

3.2. Flip-flop

3.3. SR-Latch

3.3.1. Parameter synthesis

3.4. AND–OR

3.5. IEEE 1394 Root Contention Protocol

3.5.1. Description of the model

3.5.2. Synthesis of constraints

3.6. Bounded Retransmission Protocol

3.7. CSMA/CD protocol

3.8. The SPSMALL memory

3.8.1. Description

3.8.2. A short history

3.8.3. Manually abstracted model

3.8.4. Automatically generated model

3.9. Networked automation system

3.9.1. Description of the model

3.9.2. Definition of a zone of good behavior

3.9.3. Comparison with other methods

3.10. Tools related to IMITATOR

CHAPTER 4. BEHAVIORAL CARTOGRAPHY OF TIMED AUTOMATA

4.1. The behavioral cartography algorithm

4.2. Properties

4.2.1. Acyclic parametric timed automata

4.2.2. General case

4.3. Case studies

4.3.1. Implementation

4.3.2. SR latch

4.3.3. Flip-flop

4.3.4. The root contention protocol

4.3.5. SPSMALL memory

4.4. Related work

CHAPTER 5. PARAMETER SYNTHESIS FOR HYBRID AUTOMATA

5.1. Hybrid automata with parameters

5.1.1. Basic definitions

5.1.2. Symbolic semantics of linear hybrid automata

5.2. Algorithms for hybrid automata

5.2.1. The inverse method for hybrid automata

5.2.2. Behavioral cartography of hybrid automata

5.2.3. Enhancement of the method for affine dynamics

5.3. Implementation

5.4. Discussion

5.5. Related work

CHAPTER 6. APPLICATION TO THE ROBUSTNESS ANALYSIS OF SCHEDULING PROBLEMS

6.1. Preliminaries

6.1.1. Scheduling problems

6.1.2. Timed automata augmented with stopwatches

6.2. Scheduling analysis using the inverse method

6.2.1. Modeling schedulability with timed automata

6.2.2. Robustness analysis using the inverse method

6.2.3. Schedulability zone synthesis

6.3. Application to scheduling problems

6.3.1. Jobs with deadlines

6.3.2. Schedulability zone synthesis

6.3.3. Next generation spacecraft flight control system

6.4. Discussion

6.5. Related work

CHAPTER 7. CONCLUSION AND PERSPECTIVES

7.1. Trace-based inverse method and partial orders

7.2. Preservation of temporal logics

7.3. Application to other formalisms

BIBLIOGRAPHY

INDEX

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)