On deciding synchronizability for asynchronously communicating systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6687767 (Why is no real title available?)
- scientific article; zbMATH DE number 1929967 (Why is no real title available?)
- scientific article; zbMATH DE number 6665216 (Why is no real title available?)
- CONCUR 2005 – Concurrency Theory
- Context-Bounded Analysis of Concurrent Queue Systems
- Deciding choreography realizability
- How to synchronize the heads of a multitape automaton
- Multiparty asynchronous session types
- Multiparty session types meet communicating automata
- Multitape NFA: Weak Synchronization of the Input Heads
- On Communicating Finite-State Machines
- On synchronized multi-tape and multi-head automata
- Optimal Zielonka-type construction of deterministic asynchronous automata
- Reachability analysis of communicating pushdown systems
- Realizability and verification of MSC graphs
- Synchronizability for Verification of Asynchronously Communicating Systems
- Synchronous, asynchronous, and causally ordered communication
- Verification of programs with half-duplex communication
- Verification, Model Checking, and Abstract Interpretation
- Verifying programs with unreliable channels
Cited in
(24)- scientific article; zbMATH DE number 1305002 (Why is no real title available?)
- Weakly synchronous systems with three machines are Turing powerful
- Event-B-supported choreography-defined communicating systems
- Multiparty half-duplex systems and synchronous communications
- scientific article; zbMATH DE number 5269308 (Why is no real title available?)
- Input urgent semantics for asynchronous timed session types
- Compatibility properties of synchronously and asynchronously communicating components
- Guessing the buffer bound for k-synchronizability
- Asynchronous Communication: Exact Synchronization, Universality, and Dispersion
- Hoare vs Milner: comparing synchronizations in a graphical framework with mobility
- Towards generalised half-duplex systems
- Automated verification of automata communicating via FIFO and bag buffers
- Resource-sensitive synchronization inference by abduction
- On half-synchronized systems
- An axiomatic approach to computing the connectivity of synchronous and asynchronous systems
- On the completeness of verifying message passing programs under bounded asynchrony
- Automatic analysis of complex interactions in microservice systems
- Synchronizability for Verification of Asynchronously Communicating Systems
- On the inherent weakness of conditional synchronization primitives
- On the \(k\)-synchronizability of systems
- Dealing with final state sensitivity for synchronous communication
- Automated analysis of asynchronously communicating systems
- Correspondence assertions for process synchronization in concurrent communications
- Guessing the Buffer Bound for k-Synchronizability
This page was built for publication: On deciding synchronizability for asynchronously communicating systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344799)
