Copyright © 1999 Published by Elsevier Science B.V.
Fundamental study
Operational and denotational semantics for the box algebra
Communicated by G. Rozenberg
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
This paper describes general theory underpinning the operational semantics and the denotational Petri net semantics of the box algebra including recursion. For the operational semantics, inductive rules for process expressions are given. For the net semantics, a general mechanism of refinement and relabelling is introduced, using which the connectives of the algebra are defined. The paper also describes a denotational approach to the Petri net semantics of recursive expressions. A domain of nets is identified such that the solution of a given recursive equation can be found by fixpoint approximation from some suitable starting point. The consistency of the two semantics is demonstrated. The theory is generic for a wide class of algebraic operators and synchronisation schemes.
Author Keywords: Petri nets; Process algebra; Refinement; Denotational semantics; Operational semantics; Recursion; Bisimulation







E-mail Article
Add to my Quick Links

Cited By in Scopus (12)






