Solving Recursive Net Equations
- Lookup NU author(s)
- Professor Eike Best
- Professor Maciej Koutny
|
|
|
|
| Author(s) | | Best E, Koutny M |
| Editor(s) | | Fulop, Z., Gecseg, F. |
| Publication type | | Conference Proceedings (inc. Abstract) |
| Conference Name | | 22nd International Colloquium on Automata, Languages and Programming (ICALP) |
| Conference Location | | Szeged, Hungary |
| Year of Conference | | 1995 |
| Date | | 10-14 July 1995 |
| Volume | | 944 |
| Pages | | 605-623 |
| Series Title | | Lecture Notes in Computer Science |
| ISBN | | 9783540600848 |
| |  |
|
|
|
| Full text for this publication is not currently held within this repository. Alternative links are provided below where available. |
|
|
|
|
| This paper 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. In turn, a suitable starting point can be found by fixpoint approximation on a derived domain of sets of trees. The paper explains the theory on a series of examples and then summarises the most important results. |
|
|
|
| Publisher | | Springer-Verlag |
| URL | | http://dx.doi.org/10.1007/3-540-60084-1_109 |
| DOI | | 10.1007/3-540-60084-1_109 |
| Actions | |  |
| Library holdings | | Search Newcastle University Library for this item |
