Synchronizability for Verification of Asynchronously Communicating Systems

Basu, Samik; Bultan, Tevfik; Ouederni, Meriem

doi:10.1007/978-3-642-27940-9_5

Cited by 30 publications

(43 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, we observe a similarity between our work and the work on choreographies and contracts, which turns out to be useful in model checking of asynchronous systems [4,5,25]. Basically, such choreographies serve to restrict the occurrence of diamonds in an asynchronous system, which means that it becomes synchronisable [5].…”

Section: Discussionsupporting

confidence: 58%

“…Basically, such choreographies serve to restrict the occurrence of diamonds in an asynchronous system, which means that it becomes synchronisable [5]. Perhaps it is also possible to use this idea in the other direction, i.e., to desynchronise a system using a choreography on the communication buffer.…”

Section: Discussionmentioning

confidence: 99%

“…From input-determinism we get p 3 s 6 ↔ b p 3 s 3 . And from the transfer conditions of branching bisimulation (under the concreteness assumption) we get the remaining dashed transitions (4) and (5 …”

Section: Sufficient Conditions For Desynchronisabilitymentioning

confidence: 99%

“…In the context of web-services [4,5], the focus is on effective analysis (like deadlock freedom, choreography analysis) of an asynchronous system by developing synchronisability techniques. Their idea is to make an asynchronous system synchronous, which is in contrast to desynchronisability, where a synchronous system is made asynchronous.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Avoiding diamonds in desynchronisation

Beohar

Cuijpers

2014

Science of Computer Programming

View full text Add to dashboard Cite

The design of concurrent systems often assumes synchronous communication between different parts of a system. When system components are physically apart, this assumption becomes inappropriate. Desynchronisation is a technique that aims to implement a synchronous design in an asynchronous manner by placing buffers between the components of the synchronous design. When queues are used as buffers, the so-called 'diamond property' (among others) ensures correct operation of the desynchronised design. However, this property is difficult to establish in practice.In this paper, we give sufficient and necessary conditions under which a concrete synchronous design (i.e., without the unobservable action) is equivalent to an asynchronous design and formally prove that the diamond property is no longer needed for desynchronisation when half-duplex queues are used as a communication buffer. Furthermore, we discuss how the half-duplex condition can be further relaxed when the diamond property can be partially guaranteed. To illustrate how this theory may be applied, we desynchronise the synchronous systems that are synthesised using supervisory control theory.

show abstract

Section: Discussionsupporting

confidence: 58%

Section: Discussionmentioning

confidence: 99%

Section: Sufficient Conditions For Desynchronisabilitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Avoiding diamonds in desynchronisation

Beohar

Cuijpers

2014

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…As discussed earlier, reachability is undecidable for CFSMs, in general. Basu et al [5] show that a sub-class of asynchronous CFSMs can be encoded into synchronous systems, where reachability can be efficiently computed. They present an approach for deciding whether an asynchronous system belongs to that sub-class.…”

Section: Communicating Finite-state Machinesmentioning

confidence: 99%

Asynchronously Communicating Visibly Pushdown Systems

Babić

Rakamarić

2013

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Abstract.We introduce an automata-based formal model suitable for specifying, modeling, analyzing, and verifying asynchronous task-based and message-passing programs. Our model consists of visibly pushdown automata communicating over unbounded reliable point-to-point firstin-first-out queues. Such a combination unifies two branches of research, one focused on task-based models, and the other on models of messagepassing programs. Our model generalizes previously proposed models that have decidable reachability in several ways. Unlike task-based models of asynchronous programs, our model allows sending and receiving of messages even when stacks are not empty, without imposing restrictions on the number of context-switches or communication topology. Our model also generalizes the well-known communicating finite-state machines with recognizable channel property allowing (1) individual components to be visibly pushdown automata, which are more suitable for modeling (possibly recursive) programs, (2) the set of words (i.e., languages) of messages on queues to form a visibly pushdown language, which permits modeling of remote procedure calls and simple forms of counting, and (3) the relations formed by tuples of such languages to be synchronized, which permits modeling of complex interactions among processes. In spite of these generalizations, we prove that the composite configuration and control-state reachability are still decidable for our model.

show abstract

Preserving Liveness Guarantees from Synchronous Communication to Asynchronous Unstructured Low-Level Languages

Berg

Göthel

Danziger

et al. 2018

Formal Methods and Software Engineering

View full text Add to dashboard Cite

In the implementation of abstract synchronous communication in asynchronous unstructured low-level languages, e. g. using shared variables, the preservation of safety and especially liveness properties is a hitherto open problem due to inherently different abstraction levels. Our approach to overcome this problem is threefold: First, we present our notion of handshake refinement with which we formally prove the correctness of the implementation relation of a handshake protocol. Second, we verify the soundness of our handshake refinement, i. e., all safety and liveness properties are preserved to the lower level. Third, we apply our handshake refinement to show the correctness of all implementations that realize the abstract synchronous communication with the handshake protocol. To this end, we employ an exemplary language with asynchronous shared variable communication. Our approach is scalable and closes the verification gap between different abstraction levels of communication.

show abstract

Synchronizability for Verification of Asynchronously Communicating Systems

Cited by 30 publications

References 26 publications

Avoiding diamonds in desynchronisation

Avoiding diamonds in desynchronisation

Asynchronously Communicating Visibly Pushdown Systems

Preserving Liveness Guarantees from Synchronous Communication to Asynchronous Unstructured Low-Level Languages

Contact Info

Product

Resources

About