On Communicating Finite-State Machines

Recommendations

scientific article; zbMATH DE number 2080915
On the progress of communication between two finite state machines
On "A Simple Protocol Whose Proof Isńt": The State Machine Approach
Modeling robust asynchronous communication protocols with finite-state machines
scientific article; zbMATH DE number 3892605

Cites work

A calculus of communicating systems
A calculus of mobile processes. II
scientific article; zbMATH DE number 4039251 (Why is no real title available?)
Modelling concurrent interactions
On Communicating Finite-State Machines
On Synchronous and Asynchronous Interaction in Distributed Systems
Symbolic bisimulations

Cited in

(only showing first 100 items - show all)

A note on the attractor-property of infinite-state Markov chains
Exposure to deadlock for communicating processes is hard to detect
An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
On the analysis of cooperation and antagonism in networks of communicating processes
The complexity of reachability in distributed communicating processes
A methodology for constructing communication protocols with multiple concurrent functions
Resolution-based approach to compatibility analysis of interacting automata
Reduction and covering of infinite reachability trees
The implementation of a protocol using automata
Tuning distributed control algorithms for optimal functioning
Communication for alternating machines
Verifying identical communicating processes is undecidable
Analysis of a class of communicating finite state machines
Verification in loosely synchronous queue-connected discrete timed automata.
Reachability problems for sequential dynamical systems with threshold functions.
Well-abstracted transition systems: Application to FIFO automata.
Multiparty session types, beyond duality
Automated verification of automata communicating via FIFO and bag buffers
Handling infinitely branching well-structured transition systems
Simulating perfect channels with probabilistic lossy channels
A contracting model for flexible distributed scheduling
Boundedness, empty channel detection, and synchronization for communicating finite automata
An improved protocol validation technique for a class of communication models
Verifying lossy channel systems has nonprimitive recursive complexity.
Algorithmic analysis of programs with well quasi-ordered domains.
Realizability of high-level message sequence charts: closing the gaps
On termination and invariance for faulty channel machines
Quasi-static scheduling of communicating tasks
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Process calculi as a tool for studying coordination, contracts and session types
Composition and decomposition of multiparty sessions
A core model for choreographic programming
A modular framework for verifying versatile distributed systems
Realisability of pomsets
Connecting open systems of communicating finite state machines
Reversible parallel communicating finite automata systems
Guessing the buffer bound for k-synchronizability
Communicating finite state machines and an extensible toolchain for multiparty session types
A controller synthesis framework for automated service composition
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
Fair refinement for asynchronous session types
Data flow analysis of asynchronous systems using infinite abstract domains
An abstract framework for choreographic testing
Communicating automata
Event clock message passing automata: a logical characterization and an emptiness checking algorithm
Input urgent semantics for asynchronous timed session types
Some complexity results for stateful network verification
Moving from interface theories to assembly theories
Non-deterministic transducer models of retransmission protocols over noisy channels
Computation in networks of passively mobile finite-state sensors
The transformation monoid of a partially lossy queue
Undecidability of asynchronous session subtyping
Infinite-state high-level MSCs: model-checking and realizability
Quantitative analysis of probabilistic lossy channel systems
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Message-passing automata are expressively equivalent to EMSO logic
A general approach to comparing infinite-state systems with their finite-state specifications
Verification of probabilistic systems with faulty communication
Verification of programs with half-duplex communication
Relating two automata-based models of orchestration and choreography
Verification of parameterized communicating automata via split-width
Automata for analysing service contracts
A gentle introduction to multiparty asynchronous session types
Research on the dynamic reconfiguration of Web application using two-phase compatibility verification
Synchronizability for Verification of Asynchronously Communicating Systems
Undecidability and hierarchy results for parallel communicating finite automata
Forward analysis and model checking for trace bounded WSTS
On the computational capacity of parallel communicating finite automata
Static analysis of biological regulatory networks dynamics using abstract interpretation
Pengines: Web Logic Programming Made Easy
Automata and Logics for Concurrent Systems: Five Models in Five Pages
Honesty by typing
The Paths to Choreography Extraction
On the undecidability of asynchronous session subtyping
Communicating processes, scheduling, and the complexity of nontermination
Counter-constrained finite state machines: a new model for component protocols with resource-dependencies
An automaton over data words that captures EMSO logic
Modal Interface Theories for Communication-Safe Component Assemblies
Modeling robust asynchronous communication protocols with finite-state machines
On the diversity of asynchronous communication
Synthesis of Communicating Finite-State Machines with Guaranteed Progress
Communicating finite-state machines and two-variable logic
Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
scientific article; zbMATH DE number 3862445 (Why is no real title available?)
Closed Covers: To Verify Progress for Communicating Finite State Machines
Abstract Interpretation of FIFO Replacement
Parameterized Verification of Communicating Automata under Context Bounds
On deciding synchronizability for asynchronously communicating systems
A normalized form for FIFO protocols traces, application to the replay of mode-based protocols
Compliance in behavioural contracts: a brief survey
Orchestrated session compliance
Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
Mind the Shapes: Abstraction Refinement Via Topology Invariants
Quantifying the Discord: Order Discrepancies in Message Sequence Charts
On the Computational Capacity of Parallel Communicating Finite Automata
Mixing Lossy and Perfect Fifo Channels
QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS
Analysis of Realizability Conditions for Web Service Choreographies
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
On Communicating Finite-State Machines

This page was built for publication: On Communicating Finite-State Machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3657436)