Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Timeout Order Abstraction for Time-Parametric Verification of Loosely Synchronized Real-Time Distributed Systems

Timeout Order Abstraction for Time-Parametric Verification of Loosely Synchronized Real-Time Distributed Systems

Thumbnail Image
Download
Name

Lynch_Timeout order.pdf

Size

165.48 KB

Format

Adobe PDF

Checksum (MD5)

ab10793c39f25ac429ac0ee5524ea3d8

Author(s)
Umeno, Shinya
•
Lynch, Nancy A.
Date Issued
December 2009
Journal
Proceedings of the 2nd Workshop on Compositional Theory and Technology for Real-Time Embedded Systems
Publisher
Artist Consortium
Citation
Umeno, Shinya and Nancy Lynch. "Timeout Order Abstraction for Time-Parametric Verification of Loosely Synchronized Real-Time Distributed Systems." Proceedings of the 2nd Workshop on Compositional Theory and Technology for Real-Time Embedded Systems, CRTS 2009, December 1, 2009, Washington, D.C., USA.
Version
Author's final manuscript
Abstract
We present timeout order abstraction (TO-abstraction), a technique to systematically abstract a given loosely synchronized real-time distributed system (LSRTDS) into an untimed model. We define the subclass of LSRTDS’s that we can apply TO-abstraction using a syntax template that represents a restriction to Tempo, the primary modeling language of TIOA [7]. The untimed model obtained from the abstraction is a classical finite state machine, and thus one can automatically verify temporal properties of the model using a conventional model-checker. We prove the soundness of the abstraction using simulation relation. From this result, we guarantee that any untimed safety property of the untimed model also holds for the original TIOA model. We have applied TO-abstraction to a resource-sharing protocol and the DHCP Failover protocol. We verified untimed abstractions of them by bounded model-checking up to depth 20. We have also experimented with effectiveness of bug-finding using our technique by mutating particular parts of the original code. From this experiment, we found a complex bad execution that would have been very difficult to find by human or simulations.
Description
URL to paper listed on conference site.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
http://creativecommons.org/licenses/by-nc-sa/3.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/67828
DOI of Published Version
http://www.artist-embedded.org/artist/Workshop-Program,1818.html
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.