scientific article; zbMATH DE number 7802080
From MaRDI portal
Publication:6191022
zbMath1530.68193arXiv2208.05559MaRDI QIDQ6191022
Publication date: 8 February 2024
Full work available at URL: https://arxiv.org/abs/2208.05559
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reachability problems on reliable and lossy queue automata
- Analysis of a class of communicating finite state machines
- Realizability and verification of MSC graphs
- Realizability of high-level message sequence charts: closing the gaps
- Verifying parallel programs with dynamic communication structures
- On the \(k\)-synchronizability of systems
- Infinite-state high-level MSCs: model-checking and realizability
- Verification of programs with half-duplex communication
- On Global Types and Multi-Party Session
- Multiparty Session Types Meet Communicating Automata
- Multiparty Asynchronous Session Types
- Multiparty asynchronous session types
- Verifying Communicating Multi-pushdown Systems via Split-Width
- Causal Message Sequence Charts
- On Communicating Finite-State Machines
- Data Communicating Processes with Unreliable Channels
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
- Linear type theory for asynchronous session types
- Fundamental Approaches to Software Engineering
- Context-Bounded Analysis of Concurrent Queue Systems
- Reachability Analysis of Communicating Pushdown Systems
- On the completeness of verifying message passing programs under bounded asynchrony
- Verifying asynchronous interactions via communicating session automata
- Generalising Projection in Asynchronous Multiparty Session Types.
This page was built for publication:
