Conference
A refined view of the box algebra
Abstract
This paper presents the operational semantics and the Petri net semantics of a fragment of the box algebra in tutorial style. For the operational semantics, inductive rules for marked 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. A companion paper shows how this mechanism can be extended to handle recursion.
Authors
Best E; Koutny M
Series
Lecture Notes in Computer Science
Volume
935
Pagination
pp. 1-20
Publisher
Springer Nature
Publication Date
1995
DOI
10.1007/3-540-60029-9_29
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743