Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness

@article{Cheng2009ModelingAV,
  title={Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness},
  author={Chih-Hong Cheng and Christian Buckl and Javier Esparza and Alois Knoll},
  journal={2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications},
  year={2009},
  pages={208-215}
}
  • Chih-Hong Cheng, C. Buckl, A. Knoll
  • Published 25 May 2009
  • Computer Science
  • 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
The increasing use of model-based tools enables further use of formal verification techniques in the context of distributed real-time systems. To avoid state explosion, it is necessary to construct verification models that focus on the aspects under consideration.In this paper, we discuss how we construct a verification model for timing analysis in distributed real-time systems.We (1) give observations concerning restrictions of timed automata to model these systems,(2) formulate mathematical… 

Figures from this paper

FTOS-Verify: Analysis and Verification of Non-Functional Properties for Fault-Tolerant Systems

This paper raises the precision of FTOS into pure mathematical constructs, and forms the deterministic assumption, which is necessary as an extension of Giotto-like systems to equip with fault-tolerance abilities, and shows that local properties of a system with the Deterministic assumption will be preserved in a modified synchronous system used as the verification model.

A Game-theoretic Approach for Synthesizing Fault-Tolerant Embedded Systems

This paper translates a non-fault-tolerant system into a distributed game, and performs an incomplete search of strategies to cope with undecidability, then translates back to executable code concretizing fault-tolerance mechanisms using constraint solving.

References

SHOWING 1-10 OF 16 REFERENCES

FTOS-Verify: Analysis and Verification of Non-Functional Properties for Fault-Tolerant Systems

This paper raises the precision of FTOS into pure mathematical constructs, and forms the deterministic assumption, which is necessary as an extension of Giotto-like systems to equip with fault-tolerance abilities, and shows that local properties of a system with the Deterministic assumption will be preserved in a modified synchronous system used as the verification model.

Verification of COMDES-II Systems Using UPPAAL with Model Transformation

The proposed approach adopts UPPAAL timed automata as the semantic units, to which different behavioral concerns of COMDES-II are anchored, such that a COM DES-II system can be precisely specified in UPPAal, and verified against a set of desired requirements with the preservation of system original operation semantics.

Model-based development of fault-tolerant real-time systems

The main goal is the automatic generation of code realizing non-functional systems, such as fault-tolerance mechanisms, communication in the distributed system, and scheduling, through an adequate domain-specific modeling language and a formal model for the specification of fault assumptions.

A Theory of Timed Automata

Program Repair Suggestions from Graphical State-Transition Specifications

This work investigates how to use formal techniques to generate suggestions for repairing a program that breaks the bisimulation relation with a graphical specification, and uses state graphs as a unified representation of the program models and specifications.

Generic Fault-Tolerance Mechanisms Using the Concept of Logical Execution Time

This paper presents a solution to exploit the concept of logical execution time to realize major fault-tolerance mechanisms in a generic way and hides the implementation details like the physical execution from the user.

Software Fault Tolerance: A Tutorial

How hard-to-detect design faults are likely to be introduced during development and how software faults tend to be state-dependent and activated by particular input sequences are noted.

Giotto: A Time-Triggered Language for Embedded Programming

The time-triggered nature of Giotto achieves timing predictability, which makes Giotto particularly suitable for safety-critical applications.

A hierarchical coordination language for interacting real-time tasks

This work designed and implemented a new programming language called Hierarchical Timing Language (HTL) for hard realtime systems and presents a distributed HTL implementation of an automotive steer-by-wire controller.

A task description language for robot control

  • R. SimmonsDavid Apfelbaum
  • Computer Science
    Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190)
  • 1998
TDL is an extension of C++ that provides syntactic support for task decomposition, synchronization, execution monitoring, and exception handling, and a compiler transforms TDL into pure C++ code that utilizes a platform-independent task management library.