Process calculi as a tool for studying coordination, contracts and session types
type: Item
instance of: scholarly article
title: Process calculi as a tool for studying coordination, contracts and session types
zbMATH Open document ID: 1476.68167
author: Mario Bravetti
author: Gianluigi Zavattaro
published in: Journal of Logical and Algebraic Methods in Programming
publication date: 2020-04-15T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 7189660
zbMATH Keywords: coordination primitives
zbMATH Keywords: behavioural contracts
zbMATH Keywords: session types
describes a project that uses: Linda
MaRDI profile type: Publication
full work available at URL: j.jlamp.2020.100527
OpenAlex ID: W3008244314
cites work: Generative communication in Linda
cites work: Q4222913
cites work: Q4219024
cites work: Q2729050
cites work: Q2771054
cites work: Contract Based Multi-party Service Composition
cites work: Multiparty asynchronous session types
cites work: Subtyping for session types in the pi calculus
cites work: Global Principal Typing in Partially Commutative Asynchronous Sessions
cites work: Undecidability of asynchronous session subtyping
cites work: On the Undecidability of Asynchronous Session Subtyping
cites work: On the boundary between decidability and undecidability of asynchronous session subtyping
cites work: A calculus of mobile processes. I
cites work: The covering and boundedness problems for vector addition systems
cites work: Computability of Recursive Functions
cites work: Q5590814
cites work: Well-structured transition systems everywhere!
cites work: Computer Aided Verification
cites work: Q3992568
cites work: The Must Preorder Revisited
cites work: A theory of contracts for web services
cites work: Q3601412
cites work: A complete axiomatisation for observational congruence of finite-state behaviours
cites work: Q1019128
cites work: Fair testing
cites work: Testing equivalences for processes
cites work: Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
cites work: Q5278078
cites work: Q4344149
cites work: On Communicating Finite-State Machines
cites work: A process algebraic view of shared dataspace coordination
DOI: 10.1016/J.JLAMP.2020.100527
Recommended article: Q2767175
Recommended article: Q4536321
Recommended article: Proof-Carrying Code in a Session-Typed Process Calculus
Recommended article: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
Recommended article: Process Types as a Descriptive Tool for Interaction
Recommended article: On the expressiveness and decidability of higher-order process calculi
Recommended article: Q4536594
Recommended article: CONCUR 2003 - Concurrency Theory
description: scientific article; zbMATH DE number 7189660