Convergence Verification: From Shared Memory to Partially Synchronous Systems

Chandy, K. Mani; Mitra, Sayan; Pilotto, Concetta

doi:10.1007/978-3-540-85778-5_16

Cited by 9 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is partly owing to the difficulty of finding the appropriate Lyapunov functions. In the future, we plan on investigating this further and use ideas from [Chandy et al 2008] for the progress proof. A longer term goal is to integrate all these proof techniques within the TEMPO [TEM 2008] environment.…”

Section: Discussionmentioning

confidence: 99%

Verification of Periodically Controlled Hybrid Systems: Application to An Autonomous Vehicle

Wongpiromsarn¹,

Mitra²,

Murray³

et al. 2009

Self Cite

View full text Add to dashboard Cite

This paper introduces Periodically Controlled Hybrid Automata (PCHA) for modular specification of hybrid control systems. In a PCHA, control actions that change the control input to the plant occur roughly periodically, while other actions that update the state of the controller may occur in the interim, changing the set-point of the system. Such actions could model, for example, sensor updates and information received from higher-level planning modules that change the set-point of the controller. Based on periodicity and subtangential conditions, a new sufficient condition for verifying invariant properties of PCHAs is presented. Checking these conditions can be automated using, for example, the constraint-based approach, quantifier elimination, or sum of squares decomposition. The proposed technique is used to verify safety and progress properties of the planner-controller subsystem of an autonomous ground vehicle. Geometric properties of planner generated paths are derived which guarantee that such paths can be safely followed by the controller.

show abstract

Section: Discussionmentioning

confidence: 99%

Verification of Periodically Controlled Hybrid Systems: Application to An Autonomous Vehicle

Wongpiromsarn¹,

Mitra²,

Murray³

et al. 2009

Self Cite

View full text Add to dashboard Cite

show abstract

“…For asynchronous distributed systems, where messages get nondeterministic but bounded delay, a static approach for reasoning about the convergence of an asynchronous system has been proposed [17]. The approach shows that under under some additional assumptions about the shape of the sublevel sets of the Lyapunov function, if convergence occurs in perfect communication, where messages get delivered instantly without dropping, convergence will also occur in the the corresponding synchronous system.…”

Section: Case Study Discussionmentioning

confidence: 99%

Using run-time checking to provide safety and progress for distributed cyber-physical systems

Bak

Huang

Caccamo

2013

2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications

View full text Add to dashboard Cite

Abstract-Cyber-physical systems (CPS) may interact and manipulate objects in the physical world, and therefore ideally would have formal guarantees about their behavior. Performing statictime proofs of safety invariants, however, may be intractable for systems with distributed physical-world interactions. This is further complicated when realistic communication models are considered, for which there may not be bounds on message delays, or even that messages will eventually reach their destination.In this work, we address the challenge of proving safety and progress in distributed CPS communicating over an unreliable communication layer. This is done in two parts. First, we show that system safety can be verified by partially relying upon runtime checks, and that dropping messages if the run-time checks fail will maintain safety. Second, we use a notion of compatible action chains to guarantee system progress, despite unbounded message delays. We demonstrate the effectiveness of our approach on a multi-agent vehicle flocking system, and show that the overhead of the proposed run-time checks is not overbearing.

show abstract

“…Note that this rule corresponds to the second equation of the system of linear equations. Similarly, the updating rule of agent 3, corresponding to the third equation of the system, is x[3] := 0.5 · y 3 [2] + 0.5 · y 3 [4]. That is, agent 3 sets the value of x [3] to the average of the last received messages from 2 and 4.…”

Section: Faulty Message Passing Distributed Systemmentioning

confidence: 99%

“…In this section we apply our verification framework for proving correctness of the robot pattern formation protocol described in [4]. The goal of this system is for agents to form an equispaced straight line.…”

Section: Verification Of a Robot Pattern Formation Protocolmentioning

confidence: 99%

Towards a verification framework for faulty message passing systems in PVS

Pilotto

White

2011

Innovations Syst Softw Eng

Self Cite

View full text Add to dashboard Cite

We present a library of PVS meta-theories that can be used to verify a class of distributed systems in which agent communication is via message-passing. The theoretical work, as outlined in Chandy et al. (Form Aspect Comput 2011, to appear) consists of iterative schemes for solving systems of linear equations, such as message-passing extensions of the Gauss and Gauss-Seidel methods. We briefly review that work and discuss the challenges in formally verifying it.Keywords PVS theorem-prover · Message passing systems · Methods for solving systems of linear equations

show abstract

Convergence Verification: From Shared Memory to Partially Synchronous Systems

Cited by 9 publications

References 15 publications

Verification of Periodically Controlled Hybrid Systems: Application to An Autonomous Vehicle

Verification of Periodically Controlled Hybrid Systems: Application to An Autonomous Vehicle

Using run-time checking to provide safety and progress for distributed cyber-physical systems

Towards a verification framework for faulty message passing systems in PVS

Contact Info

Product

Resources

About