Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

APN

1995

Springer

1995

Springer

The ﬁrst part of this paper gives an algebraic semantics for Place/Transition nets in terms of an algebra which is based on the process algebra ACP. The algebraic semantics is such that a P/T net and its term representation have the same operational behavior. As opposed to other approaches in the literature, the actions in the algebra do not correspond to the ﬁring of a transition, but to the consumption or production of tokens. Equality of P/T nets can be determined in a purely equational way. The second part of this paper extends the results to hierarchical P/T nets. It gives a compositional algebraic semantics for both their complete operational behavior and their high-level, observable behavior. By means of a non-trivial example, the Alternating-Bit Protocol, it is shown that the notions of abstraction and veriﬁcation in the process algebra ACP can be used to verify in an equational way whether a hierarchical P/T net satisﬁes some algebraic speciﬁcation of its observable...

Added |
25 Aug 2010 |

Updated |
25 Aug 2010 |

Type |
Conference |

Year |
1995 |

Where |
APN |

Authors |
Twan Basten, Marc Voorhoeve |

Comments (0)