# Communicating finite-state machine

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- Comput. J.
- 2009

oracles may be used instead of characterization sets to check the precise or abstract state, respectively, of the cor-Â

Is this relevant?

2007

2007

- 5th IEEE International Conference on Industrialâ€¦
- 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)

Is this relevant?

2001

2001

- FORTE
- 2001

In this paper, we propose a method for diagnostic test derivation when the system specification and implementation are given inâ€¦Â (More)

Is this relevant?

1995

1995

- ICCCN
- 1995

Reachability analysis and the recently proposed reverse reachability analysis are two important verification techniques f o râ€¦Â (More)

Is this relevant?

1994

1994

- ICNP
- 1994

W e propose two variants of the classical Communicating Finite State Machines (CFSMs) model SingleLink Communicating Finite Stateâ€¦Â (More)

Is this relevant?

1993

1993

- PADS '93
- 1993

We describe, in this paper, a synchronization/deadlock resolution mechanism for a network of communicating finite state machinesâ€¦Â (More)

Is this relevant?

1991

1991

- ACM Trans. Program. Lang. Syst.
- 1991

Let ( Fâ€™l, Pz, . . . . Pm) be a network of n finite state machines, communicating with each other asynchronously using typedâ€¦Â (More)

Is this relevant?

1986

1986

- ACM Trans. Program. Lang. Syst.
- 1986

Consider a network of communicating finite state machines that exchange messages over unbounded FIFO channels. Each machine inâ€¦Â (More)

Is this relevant?

1984

1984

- IEEE Transactions on Software Engineering
- 1984

Consider communicating finite state machines which exchange messages over unbounded FIFO channels. We discuss a technique toâ€¦Â (More)

Is this relevant?

1982

1982

- ArXiv
- 1982

1. Introduction 2. Introductory examples 3. Communicating finite state machines 4. Reachability properties 5. Reachabilityâ€¦Â (More)

Is this relevant?