On deciding synchronizability for asynchronously communicating systems

DOI10.1016/j.tcs.2016.09.023zbMath1353.68195OpenAlexW2528284453MaRDI QIDQ344799

Samik Basu, Tevfik Bultan

Publication date: 24 November 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.023

zbMATH Keywords

verificationasynchronous systemssynchronizabilitymessage-passing systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Event-B-Supported Choreography-Defined Communicating Systems ⋮ Automatic analysis of complex interactions in microservice systems ⋮ Guessing the Buffer Bound for k-Synchronizability ⋮ Multiparty half-duplex systems and synchronous communications ⋮ On the \(k\)-synchronizability of systems ⋮ Unnamed Item ⋮ Input urgent semantics for asynchronous timed session types ⋮ Guessing the buffer bound for k-synchronizability

Uses Software

• WSAT
• SPIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On synchronized multi-tape and multi-head automata
• Realizability and verification of MSC graphs
• Verifying programs with unreliable channels
• Verification of programs with half-duplex communication
• Multitape NFA: Weak Synchronization of the Input Heads
• Synchronizability for Verification of Asynchronously Communicating Systems
• Multiparty Session Types Meet Communicating Automata
• Deciding choreography realizability
• Multiparty asynchronous session types
• Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
• On Communicating Finite-State Machines
• Synchronous, asynchronous, and causally ordered communication
• HOW TO SYNCHRONIZE THE HEADS OF A MULTITAPE AUTOMATON
• Context-Bounded Analysis of Concurrent Queue Systems
• Verification, Model Checking, and Abstract Interpretation
• CONCUR 2005 – Concurrency Theory
• Reachability Analysis of Communicating Pushdown Systems

This page was built for publication: On deciding synchronizability for asynchronously communicating systems