Pages that link to "Item:Q3657436"

The following pages link to On Communicating Finite-State Machines (Q3657436):

Displaying 50 items.

• A modular framework for verifying versatile distributed systems (Q2011199) (← links)
• Realisability of pomsets (Q2011200) (← links)
• Connecting open systems of communicating finite state machines (Q2011202) (← links)
• Reversible parallel communicating finite automata systems (Q2041681) (← links)
• Guessing the buffer bound for k-synchronizability (Q2117668) (← links)
• Communicating finite state machines and an extensible toolchain for multiparty session types (Q2140476) (← links)
• A controller synthesis framework for automated service composition (Q2177764) (← links)
• Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
• Fair refinement for asynchronous session types (Q2233400) (← links)
• Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
• An abstract framework for choreographic testing (Q2239278) (← links)
• Event clock message passing automata: a logical characterization and an emptiness checking algorithm (Q2248059) (← links)
• Input urgent semantics for asynchronous timed session types (Q2329441) (← links)
• Some complexity results for stateful network verification (Q2335903) (← links)
• Moving from interface theories to assembly theories (Q2340257) (← links)
• Non-deterministic transducer models of retransmission protocols over noisy channels (Q2346564) (← links)
• Computation in networks of passively mobile finite-state sensors (Q2375293) (← links)
• The transformation monoid of a partially lossy queue (Q2399374) (← links)
• Undecidability of asynchronous session subtyping (Q2407107) (← links)
• Infinite-state high-level MSCs: model-checking and realizability (Q2495403) (← links)
• Quantitative analysis of probabilistic lossy channel systems (Q2495651) (← links)
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
• Message-passing automata are expressively equivalent to EMSO logic (Q2503037) (← links)
• A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
• Verification of probabilistic systems with faulty communication (Q2573634) (← links)
• Verification of programs with half-duplex communication (Q2573635) (← links)
• Verification of Parameterized Communicating Automata via Split-Width (Q2811340) (← links)
• Automata for Analysing Service Contracts (Q2811923) (← links)
• A Gentle Introduction to Multiparty Asynchronous Session Types (Q2822666) (← links)
• Research on the dynamic reconfiguration of Web application using two-phase compatibility verification (Q2874308) (← links)
• Synchronizability for Verification of Asynchronously Communicating Systems (Q2891401) (← links)
• Undecidability and hierarchy results for parallel communicating finite automata (Q2909096) (← links)
• On the computational capacity of parallel communicating finite automata (Q2909225) (← links)
• Static analysis of biological regulatory networks dynamics using abstract interpretation (Q2909733) (← links)
• Pengines: Web Logic Programming Made Easy (Q2931263) (← links)
• Automata and Logics for Concurrent Systems: Five Models in Five Pages (Q2947404) (← links)
• Honesty by Typing (Q2974791) (← links)
• The Paths to Choreography Extraction (Q2988384) (← links)
• On the Undecidability of Asynchronous Session Subtyping (Q2988385) (← links)
• Communicating processes, scheduling, and the complexity of nontermination (Q3034829) (← links)
• An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
• Modal Interface Theories for Communication-Safe Component Assemblies (Q3105749) (← links)
• Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)
• Rational, recognizable, and aperiodic sets in the partially lossy queue monoid (Q3304144) (← links)
• Closed Covers: To Verify Progress for Communicating Finite State Machines (Q3339299) (← links)
• Abstract Interpretation of FIFO Replacement (Q3392924) (← links)
• Parameterized Verification of Communicating Automata under Context Bounds (Q3447694) (← links)
• A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols (Q3460215) (← links)
• Compliance in Behavioural Contracts: A Brief Survey (Q3460865) (← links)
• Mind the Shapes: Abstraction Refinement Via Topology Invariants (Q3510783) (← links)