De Nicola, Rocco and Labella, Anna A Completeness Theorem for Nondeterministic Kleene Algebras. In: Mathematical Foundations of Computer Science 1994. Lecture Notes in Computer Science, 841 . Springer, pp. 536-545. ISBN 3-540-58338-6 (1994)Full text not available from this repository.
A generalization of Kleene Algebras (structures with +·*, 0 and 1 operators) is considered to take into account possible nondeterminism expressed by the + operator. It is shown that essentially the same complete axiomatization of Salomaa is obtained except for the elimination of the distribution P·(Q + R) = P·Q + P·R and the idempotence law P + P = P. The main result is that an algebra obtained from a suitable category of labelled trees plays the same role as the algebra of regular events. The algebraic semantics and the axiomatization are then extended by adding OHgr and par operator, and the whole set of laws is used as a touchstone for starting a discussion over the laws for deadlock, termination and divergence proposed for models of concurrent systems.
|Item Type:||Book Section|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||13 Jun 2011 13:10|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)