File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Book Chapter: Compiling heterarchical programs by means of Petri nets

TitleCompiling heterarchical programs by means of Petri nets
Authors
KeywordsD.1.5
D.3.3
Object-oriented programming
Language constructs and Features
Issue Date1995
PublisherSpringer
Citation
Compiling heterarchical programs by means of Petri nets. In Software Quality and Productivity, p. 92-95. United States: Springer, 1995 How to Cite?
AbstractWe present a method for compiling a program which does not have a conventional tree-like hierarchy of control. Such a structure can arise quite naturally in applications which are strongly user-interactive or contain significant elements of transaction processing, dynamic modelling or process control. Having a heterarchical structure, the application program is capable of being executed simultaneously at an unlimited number of points. Thus a program involving parallel distributed processing, interleaving between processors or multithreading might take advantage of this approach. The encompassing execution strategy is based on the idea of tokens moving through a variant of a Petri net under the control of a firing protocol. We describe an approach to modelling control structures with Petri net semantics and means taken to provide complete reactivation control at run time.
Persistent Identifierhttp://hdl.handle.net/10722/209161
ISBN
ISSN
2015 SCImago Journal Rankings: 0.160

 

DC FieldValueLanguage
dc.contributor.authorEvans, JB-
dc.date.accessioned2015-04-01T07:22:20Z-
dc.date.available2015-04-01T07:22:20Z-
dc.date.issued1995-
dc.identifier.citationCompiling heterarchical programs by means of Petri nets. In Software Quality and Productivity, p. 92-95. United States: Springer, 1995-
dc.identifier.isbn978-1-4757-6544-1-
dc.identifier.issn1868-4238-
dc.identifier.urihttp://hdl.handle.net/10722/209161-
dc.description.abstractWe present a method for compiling a program which does not have a conventional tree-like hierarchy of control. Such a structure can arise quite naturally in applications which are strongly user-interactive or contain significant elements of transaction processing, dynamic modelling or process control. Having a heterarchical structure, the application program is capable of being executed simultaneously at an unlimited number of points. Thus a program involving parallel distributed processing, interleaving between processors or multithreading might take advantage of this approach. The encompassing execution strategy is based on the idea of tokens moving through a variant of a Petri net under the control of a firing protocol. We describe an approach to modelling control structures with Petri net semantics and means taken to provide complete reactivation control at run time.-
dc.languageeng-
dc.publisherSpringer-
dc.relation.ispartofSoftware Quality and Productivity-
dc.subjectD.1.5-
dc.subjectD.3.3-
dc.subjectObject-oriented programming-
dc.subjectLanguage constructs and Features-
dc.titleCompiling heterarchical programs by means of Petri nets-
dc.typeBook_Chapter-
dc.identifier.emailEvans, JB: evans@cs.hku.hk-
dc.identifier.doi10.1007/978-0-387-34848-3_14-
dc.identifier.hkuros541-
dc.identifier.spage92-
dc.identifier.epage95-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats