Lookup NU author(s): Professor Eike Best,
Professor Maciej Koutny
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.
Author(s): Best E, Koutny M
Editor(s): Fulop, Z., Gecseg, F.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 22nd International Colloquium on Automata, Languages and Programming (ICALP)
Year of Conference: 1995
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science