Paper Info
Title
Compositional Process Semantics of Petri Boxes
Abstract
The Petri Box algebra defines a linear notation to express a structured class of Petri nets which can be seen as a modification and generalisation of Milner's CCS. The calculus has been designed as an intermediate stage in the compositional translation of higher level concurrent programming notations into Petri nets. This paper defines the notion of a Box process intended to capture the (Petri net) partial order semantics of the Box algebra. The main result is the equivalence of the direct compositional semantics so defined, and the indirect non-compositional semantics which uses processes of Petri nets, for a class of expressions.
Year
DOI
Venue
1993
10.1007/3-540-58027-1_12
MFPS
Keywords
Field
DocType
petri boxes,compositional process semantics,petri net
Principle of compositionality,Operational semantics,Programming language,Petri net,Expression (mathematics),Computer science,Denotational semantics,Process architecture,Semantics,Petri dish
Conference
ISBN
Citations 
PageRank 
3-540-58027-1
4
0.55
References 
Authors
13
2
Name
Order
Citations
PageRank
Eike Best127456.26
Hans-Günther Linde-Göers241.22