Loading...
Loading...

Go to the content (press return)

Finite memory devices in CSP

Author
Gabarro, J.; Serna, M.
Type of activity
Report
Date
1990-01
Code
LSI-90-40
Repository
http://hdl.handle.net/2117/191928 Open in new window
Abstract
It is often said that a state based approach to CSP is inadequate, however we present here some (theoretical) hints against this assertion. A new class of processes modelled by finite memory devices are considered. These devices (called here CSP automata) allow both: deal with the different kinds of nondeterminism at a state level and model misbehaviours due to divergences. They are well adapted to the semantics of failures plus divergences. As CSP is independent of branching time CSP-automata c...
Citation
Gabarro, J.; Serna, M. "Finite memory devices in CSP". 1990.
Keywords
CSP, Failures model, Finite automata, Linear system, Minimization, Morphism, Normal forms, Refinement, State-based-approach
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

Attachments