Solving Recursive Net Equations

  1. Lookup NU author(s)
  2. Professor Eike Best
  3. Professor Maciej Koutny
Author(s)Best E, Koutny M
Editor(s)Fulop, Z., Gecseg, F.
Publication type Conference Proceedings (inc. Abstract)
Conference Name22nd International Colloquium on Automata, Languages and Programming (ICALP)
Conference LocationSzeged, Hungary
Year of Conference1995
Date10-14 July 1995
Volume944
Pages605-623
Series TitleLecture Notes in Computer Science
ISBN9783540600848
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.
PublisherSpringer-Verlag
URLhttp://dx.doi.org/10.1007/3-540-60084-1_109
DOI10.1007/3-540-60084-1_109
ActionsLink to this publication
Library holdingsSearch Newcastle University Library for this item