Laurent Fribourg, Marcos Veloso Peixoto.
Concurrent Constraint Automata.
International Logic Programming Symposium,
1993.
Abstract:We address the problem of the specification and the
proof of properties of concurrent systems which
manipulate an unbounded number of data. We propose
an approach based on an extended notion of automata,
called "Concurrent Constraint Automata (CCA)". A CCA
is an automaton with constraints and synchronous
communication. By automata with constraints, we mean
a state machine whose actions and states contain
parameters that take their value in the set of
natural numbers. (...)
