On the diversity of asynchronous communication
type: Item
instance of: scholarly article
title: On the diversity of asynchronous communication
zbMATH Open document ID: 1345.68022
author: Florent Chevrou
author: Aurélie Hurault
author: Philippe Quéinnec
published in: Formal Aspects of Computing
publication date: 2016-09-20T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 6628718
zbMATH Keywords: asynchronous communication
zbMATH Keywords: formal verification
zbMATH Keywords: compatibility checking
zbMATH Keywords: \(\mathrm{TLA}^{+}\)
describes a project that uses: CADP
describes a project that uses: FDR2
describes a project that uses: PlusCal
describes a project that uses: BESERIAL
describes a project that uses: SPIN
MaRDI profile type: Publication
full work available at URL: s00165-016-0379-x
OpenAlex ID: W2346504990
cites work: The chemical abstract machine
cites work: Synchronizability for Verification of Asynchronously Communicating Systems
cites work: Formalizing web service choreographies
cites work: On the Asynchronous Nature of the Asynchronous π-Calculus
cites work: On Communicating Finite-State Machines
cites work: Synchronous, asynchronous, and causally ordered communication
cites work: Q4864256
cites work: Mobile ambients
cites work: Compatibility and inheritance in software architectures
cites work: A generic framework for \(n\)-protocol compatibility checking
cites work: A calculus of mobile agents
cites work: One Logic to Use Them All
cites work: CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
cites work: Necessary and sufficient conditions on information for causal message ordering and their optimal implementation
cites work: Distributed Computing
cites work: Time, clocks, and the ordering of events in a distributed system
cites work: Q4934623
cites work: The PlusCal Algorithm Language
cites work: Q3126969
cites work: A calculus of communicating systems
cites work: Q4248252
cites work: Q4002642
cites work: Distributed Algorithms for Message-Passing Systems
cites work: The causal ordering abstraction and a simple way to implement it
cites work: Detecting causal relationships in distributed computations: In search of the holy grail
cites work: Introduction to Distributed Algorithms
DOI: 10.1007/S00165-016-0379-X
description: scientific article; zbMATH DE number 6628718