Using Petri nets to represent systems, a framework is proposed for formulating the notion of one system being a distributed implementation of another, with a classification of whether an implementation introduces any additional activity and whether it introduces an unbounded amount of communication activity. We give net structure characterisations of those systems for which there is always a distributed implementation within a particular classification; and general constructions for those implementations.
KeywordsPetri Nets Distributed Systems Processor Placement
Unable to display preview. Download preview PDF.
- E. Best, "Structure Theory of Nets: the Free Choice Hiatus", Lecture Notes in Computer Science 254, Springer Verlag (1986).Google Scholar
- J. Hall, R. Hopkins, O. Botti, F. DeCindio, "A Petri Net Semantics of Occam", Technical Report, Computing Laboratory, University of Newcastle upon Tyne, (1990).Google Scholar
- W. Reisig, "Place/Transition Systems", Lecture Notes in Computer Science 254, Springer Verlag (1986).Google Scholar
- V.E. Kotov, "An Algebra for Parallelism based on Petri Nets", in J. Winkowski (ed.) Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 64, Springer Verlag (1978).Google Scholar
- R.P. Hopkins and J. Hall, "Towards a Petri Net Programming Notation", Technical Memorandum, ESPRIT BRA 3148 DEMON (1990).Google Scholar
- G.N. Buckley and A. Silberschatz, "An Effective Implementation for the Generalised Input-Output Construct of CSP"Google Scholar