An Efficient Explicit-time Description Method for Timed Model Checking

@inproceedings{Wang2009AnEE,
  title={An Efficient Explicit-time Description Method for Timed Model Checking},
  author={Hao Wang and Wendy MacCaull},
  booktitle={PDMC},
  year={2009}
}
Timed modelchecking,the methodtoformallyverifyreal-timesystems, is attractingincreasingatten-tion from both the model checking community and the real-time community. Explicit-time descrip-tion methods verify real-time systems using general model constructs found in standard un-timedmodel checkers. Lamport proposed an explicit-time description method [17] using a clock-tickingprocess (Tick) to simulate the passage of time together with a group of global variables to model timerequirements. Two… 

Figures from this paper

Verifying Real-Time Systems using Explicit-time Description Methods

A new explicit-time description method with no reliance on global variables is proposed, which achieves better modularity and facilitates usage of more complex timing constraints.

An Automated Translator for Model Checking Time Constrained Workflow Systems

An automated translator, YAWL2DVEt, is presented, which takes as input a time constrained workflow model built with the graphical modeling tool YAWl, and outputs the model in DVE, the system specification language for the distributed LTL model checker DiVinE.

YAWL2DVE: An Automated Translator for Workflow Verification

  • F. RabbiHao WangW. MacCaull
  • Computer Science
    2010 Fourth International Conference on Secure Software Integration and Reliability Improvement
  • 2010
An automated translator (YAWL2DVE) is presented which can convert a graphical workflow model into DVE, the input language of DiVinE, a distributed and parallel model checker which can effectively handle the well known "state explosion problem" of this domain.

Modeling and Verifying Timed Compensable Workflows and an Application to Health Care

A method to enhance the reliability of real world workflows by incorporating timed compensable tasks into the workflows, and by using formal verification methods (e.g., model checking) to provide rapid (re)design and verification of timed compensateable workflows is provided.

Towards workflow verification

This paper presents a translation of a collection of established Workflow Patterns into DVE, the input specification language of DiVinE, and can verify properties of workflow models by assembling the corresponding DVE translated patterns into a whole model.

Compensable WorkFlow Nets

A graphical modeling language Compensable Workflow Modeling Language (CWML) is introduced and a case study is presented, using CWML to model a real world scenario, and the resulting CWF-net is translated into DVE (the input language of the DiVinE model checker) and verified to verify properties of interest.

Verification of Careflow Management Systems with Timed BDICTL Logic

A prototype next-generation multi-threaded model checker is presented to reason about timed processes in careflows sensitive to patient preferences and the goals of the careteam using a temporal logic extended with modalities of beliefs, desires and intentions.

Model checking timed properties of healthcare processes

A prototype next generation multithreaded model checker is described to reason about processes in careflows, sensitive to patient preferences and the goals of the careteam using a timed temporal logic extended with modalities of beliefs, desires, and intentions.

An Semi-formal Co-verification Approach for High-Assurance CPS

This paper introduces a semi-formal verification methodology in which formal co-verification and co-simulation are tightly coupled, and proposes an online-capture offline-replay approach to improve the usefulness for formal verification.

Using an interdisciplinary approach to develop a knowledge-driven careflow management system for collaborative patient-centred palliative care

In this paper, we give a work-in-progress report of an interdisciplinary partnership among academic researchers, a regional health authority and an industry partner to develop a web-based platform to

References

SHOWING 1-10 OF 32 REFERENCES

Verifying Real-Time Systems using Explicit-time Description Methods

A new explicit-time description method with no reliance on global variables is proposed, which achieves better modularity and facilitates usage of more complex timing constraints.

An Abstraction Technique for Real-Time Verification

The GoAbstraction, a technique to reduce the size of the state space based on a conservative approximation of the region automaton, makes it possible to verify larger systems and introduces auxiliary variables, called Go variables, that limit the drifting of clock variables in the abstract system.

Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata

The paper surveys some of the most recent approaches to verification of properties, expressible in some timed and untimed temporal logics, for real-time systems represented by time Petri nets (TPN’s), and focuses on bounded model checking for TCTL and for reachability properties.

Modeling and Verification of a Fault-Tolerant Real-Time Startup Protocol Using Calendar Automata

A new modeling framework based on event calendars enables dense timed systems to be described without relying on continuously varying clocks and is applied to the fault-tolerant real-time startup protocol used in the Timed Triggered Architecture.

Introducing Time in an Industrial Application of Model-Checking

Time is introduced into existing models and examined in the context of level crossings to demonstrate the feasibility of integrating an explicit model of time into model checking.

Logics and Models of Real Time: A Survey

We survey logic-based and automata-based languages and techniques for the specification and verification of real-time systems. In particular, we discuss three syntactic extensions of temporal logic:

Symbolic model checking: an approach to the state explosion problem

The symbolic model checking technique revealed subtle errors in this protocol, resulting from complex execution sequences that would occur with very low probability in random simulation runs, and an alternative method is developed for avoiding the state explosion in the case of asynchronous control circuits.

A Theory of Timed Automata

Efficient large-scale model checking

This work examines one well-known distributed model checker, DiVinE, in detail, and shows how a number of additional optimizations in its runtime system enable it to efficiently check very demanding problem instances on a large-scale, multi-core compute cluster.

Cluster-Based LTL Model Checking of Large Systems

This work surveys distributed-memory enumerative LTL model checking algorithms designed for networks of workstations communicating via MPI both theoretically and experimentally and determines cases where particular algorithms can be successful.