The Box Algebra=Petri Nets+Process Expressions
- Lookup NU author(s)
- Professor Eike Best
- Professor Maciej Koutny
|
|
|
|
| Author(s) | | Best E, Devillers R, Koutny M |
| Publication type | | Article |
| Journal | | Information and Computation |
| Year | | 2002 |
| Volume | | 178 |
| Issue | | 1 |
| Pages | | 44-100 |
| ISSN (print) | | 0890-5401 |
| ISSN (electronic) | | 1090-2651 |
|
|
|
| Full text for this publication is not currently held within this repository. Alternative links are provided below where available. |
|
|
|
|
| The paper describes a Petri net as well as a structural operational semantics for an algebra of process expressions. It specifically addresses this problem for the box algebra, a model of concurrent computation which combines Petri nets and standard process algebras. The main result is that it is possible to obtain a framework where process expressions can be given two, entirely consistent, kinds of semantics: one based on Petri nets, the other on SOS rules. This consistency can also be extended to a partial order semantics. |
|
|
|
| Publisher | | Academic Press |
| URL | | http://dx.doi.org/10.1006/inco.2002.3117 |
| DOI | | 10.1006/inco.2002.3117 |
|
|
Actions | |   |
