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

scientific article; zbMATH DE number 4039251 (Why is no real title available?)
A calculus of communicating systems
A calculus of mobile processes. II
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)

Modeling robust asynchronous communication protocols with finite-state machines
Reversible parallel communicating finite automata systems
Protocol analysis and synthesis by structured partitions
Reasoning about knowledge and messages in asynchronous multi-agent systems
scientific article; zbMATH DE number 7453189 (Why is no real title available?)
REGULAR STATE MACHINES
Boundedness, hierarchy of fairness, and communication networks with delay
Quasi-static scheduling of communicating tasks
Global progress for dynamically interleaved multiparty sessions
Guessing the Buffer Bound for k-Synchronizability
Temporal logics for concurrent recursive programs: satisfiability and model checking
Computation in networks of passively mobile finite-state sensors
Weakly synchronous systems with three machines are Turing powerful
Multi-buffer simulations for trace language inclusion
Infinite-state high-level MSCs: model-checking and realizability
Analysis of a class of communicating finite state machines
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Verifying lossy channel systems has nonprimitive recursive complexity.
Parameterized broadcast networks with registers: from NP to the frontiers of decidability
Fair asynchronous session subtyping
Some complexity results for stateful network verification
Multiparty session types, beyond duality
An automata-based approach for synchronizable mailbox communication
Completeness of asynchronous session tree subtyping in Coq
The complexity of reachability in distributed communicating processes
scientific article; zbMATH DE number 7561314 (Why is no real title available?)
Algorithmic analysis of programs with well quasi-ordered domains.
On deciding synchronizability for asynchronously communicating systems
Realisability of pomsets
QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Message-passing automata are expressively equivalent to EMSO logic
Verification of programs with half-duplex communication
Quantitative analysis of probabilistic lossy channel systems
A gentle introduction to multiparty asynchronous session types
Realizable causal-consistent reversible choreographies for systems with first-in-first-out communication channels
Tuning distributed control algorithms for optimal functioning
Orchestrated session compliance
Complexity of reachability problems for finite discrete dynamical systems
Distributed Control of Discrete-Event Systems: A First Step
Hypernode automata
Composition and decomposition of multiparty sessions
A note on the attractor-property of infinite-state Markov chains
Relating Session Types and Behavioural Contracts: The Asynchronous Case
On the satisfiability of context-free string constraints with subword-ordering
Honesty by typing
The transformation monoid of a partially lossy queue
A controller synthesis framework for automated service composition
Analysis of Realizability Conditions for Web Service Choreographies
Precise Subtyping for Asynchronous Multiparty Sessions
Verification of probabilistic systems with faulty communication
Static analysis of biological regulatory networks dynamics using abstract interpretation
Comparing channel restrictions of communicating state machines, high-level message sequence charts, and multiparty session types
Realizability of high-level message sequence charts: closing the gaps
Handling infinitely branching well-structured transition systems
A contracting model for flexible distributed scheduling
Closed Covers: To Verify Progress for Communicating Finite State Machines
scientific article; zbMATH DE number 3862445 (Why is no real title available?)
Abstract Interpretation of FIFO Replacement
The inclusion structure of partially lossy queue monoids and their trace submonoids
Heterogeneous and asynchronous networks of timed systems
An improved protocol validation technique for a class of communication models
A normalized form for FIFO protocols traces, application to the replay of mode-based protocols
On the progress of communication between two finite state machines
A core model for choreographic programming
Safe orchestrated multicomposition of systems of communicating finite state machines
Exposure to deadlock for communicating processes is hard to detect
TSO games -- on the decidability of safety games under the total store order semantics
It is easy to be wise after the event: communicating finite-state machines capture first-order logic with ``happened before
A modern mathematical theory of co-operating state machines
Data flow analysis of asynchronous systems using infinite abstract domains
Mind the Shapes: Abstraction Refinement Via Topology Invariants
A general approach to comparing infinite-state systems with their finite-state specifications
On Communicating Finite-State Machines
scientific article; zbMATH DE number 3967907 (Why is no real title available?)
Timeout asynchronous session types: safe asynchronous mixed-choice for timed interactions
An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
Complete multiparty session type projection with automata
Rational, recognizable, and aperiodic partially lossy queue languages
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
On termination and invariance for faulty channel machines
Communicating finite-state machines and two-variable logic
Safe composition of systems of communicating finite state machines
FM 2005: Formal Methods
On Composing Communicating Systems
Research on the dynamic reconfiguration of Web application using two-phase compatibility verification
TSO games -- on the decidability of safety games under the total store order semantics
Reachability and safety games under TSO semantics
Synchronisability in mailbox communication
On "A Simple Protocol Whose Proof Isńt": The State Machine Approach
scientific article; zbMATH DE number 7327953 (Why is no real title available?)
Progress-preserving refinements of CTA
Model-checking timed temporal logics
Timed hyperproperties
Reachability problems on reliable and lossy queue automata
Mixing Lossy and Perfect Fifo Channels
A dynamic temporal logic for quality of service in choreographic models

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)