Boundedness, empty channel detection, and synchronization for communicating finite automata

Authors:
L E Rosier;H C Yen
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
1986

Citing 0
Cited 4

Symbolic Verification of Communication Protocols with Infinite StateSpaces using QDDs

Formal Methods in System Design
Eliminating the storage tape in reachability constructions

Theoretical Computer Science
Decidability of the termination problem for completely specified protocols

Distributed Computing
Calibrating embedded protocols on asynchronous systems

Information Sciences: an International Journal

Quantified Score

Hi-index	5.23

Visualization

Abstract