Communicating finite-state machine

In computer science, a communicating finite-state machine is a finite state machine labeled with "receive" and "send" operations over some alphabet… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
oracles may be used instead of characterization sets to check the precise or abstract state, respectively, of the cor- 
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
2007
2007
The W-method is one of the most general and widely used methods for generating tests from a finite state machine (FSM). The paper… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2001
2001
In this paper, we propose a method for diagnostic test derivation when the system specification and implementation are given in… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
1995
1995
Reachability analysis and the recently proposed reverse reachability analysis are two important verification techniques f o r… (More)
  • figure 2
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
1994
1994
W e propose two variants of the classical Communicating Finite State Machines (CFSMs) model SingleLink Communicating Finite State… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
1993
1993
We describe, in this paper, a synchronization/deadlock resolution mechanism for a network of communicating finite state machines… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
1991
1991
Let ( F’l, Pz, . . . . Pm) be a network of n finite state machines, communicating with each other asynchronously using typed… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
1986
1986
Consider a network of communicating finite state machines that exchange messages over unbounded FIFO channels. Each machine in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
1984
1984
Consider communicating finite state machines which exchange messages over unbounded FIFO channels. We discuss a technique to… (More)
  • figure 5
Is this relevant?
1982
1982
1. Introduction 2. Introductory examples 3. Communicating finite state machines 4. Reachability properties 5. Reachability… (More)
  • figure 2.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
Is this relevant?