A Timeless Model for the Verification of Quasi-Periodic Distributed - - PowerPoint PPT Presentation

a timeless model for the verification of quasi periodic
SMART_READER_LITE
LIVE PREVIEW

A Timeless Model for the Verification of Quasi-Periodic Distributed - - PowerPoint PPT Presentation

A Timeless Model for the Verification of Quasi-Periodic Distributed Systems Maryam Dabaghchian Zvonimir Rakamari School of Computing University of Utah Motivating Example Safety property: speed is always in a valid range Liveness property:


slide-1
SLIDE 1

A Timeless Model for the Verification of Quasi-Periodic Distributed Systems

Maryam Dabaghchian Zvonimir Rakamarić School of Computing University of Utah

slide-2
SLIDE 2

Motivating Example

Safety property: speed is always in a valid range Liveness property: speed eventually becomes zero if the operator sends stop command

2

slide-3
SLIDE 3

Model Using State Machines

Discrete transition s,t s’,t s,t’ Delay transition s,t

These systems are usually verified using model checking

s: program state (variables’ valuation) t: clock value

3

Continuous time progress Discrete time progress Timeless model:

  • Eliminate the time notion; and so the delay transitions
  • Allows checking of safety properties
  • Not suitable for checking of liveness properties
  • Source of fairness violation: processes that need at least

zero messages in their buffers to get enabled