Distinguishing between communicating transactions

DOI10.1016/j.ic.2017.12.001zbMath1388.68198arXiv1703.03256OpenAlexW2601905883MaRDI QIDQ1706141

Vasileios Koutavas, Maciej Gazda, Matthew C. B. Hennessy

Publication date: 21 March 2018

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.03256

zbMATH Keywords

bisimulationHennessy-Milner logiccommunicating transactionsnon-isolated transactions

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Unnamed Item

Uses Software

• Uppaal
• Transactors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal logics for mobile processes
• A new approach to abstract syntax with variable binding
• On reduction-based process semantics
• Nominal logic, a first order theory of names and binding
• A domain equation for bisimulation
• Transactional events
• Communicating Transactions
• Algebraic laws for nondeterminism and concurrency
• Transactors
• Bisimulations for Communicating Transactions
• Formal Methods for the Design of Real-Time Systems
• cJoin: Join with communicating transactions
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Distinguishing between communicating transactions