PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Interpreted Nets

Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
The nets considered here are an extension of Petri nets in two aspects. In the semantic aspect, there is no one firing rule common to all transitions, but every transition is treated as an operator on data stored in its entry places and return results in its exit places. A state (marking) is a mapping of places (variables) into a given data structure, while interpretation is a mapping of transitions into a set of state transformers. Locality of transition's activity is like in Petri nets. In the structural aspect, entry and exit places to a transition are ordered. A concatenation of such nets is defined, hence their calculus (a monoid). This allows for combining small nets into large ones, in particular designing a computation and control parts separately, then putting them together into one. Such extended nets may produce, in particular, other nets. A number of properties of the operation on nets and their decomposition are demonstrated.
Wydawca
Rocznik
Strony
283--293
Opis fizyczny
bibliogr. 11 poz.
Twórcy
autor
Bibliografia
  • [1] W. Brauer (ed.): Net Theory and Applications, LNCS 84 (1980)
  • [2] L. Czaja: Making Nets Abstract and Structured, in: Advances in Petri Nets 1985 (G. Goos and J. Hartmanis eds.), Lecture Notes in Computer Science 222
  • [3] H. Genrich, K. Lautenbach: System Modelling with High Level Petri Nets, Theoretical Computer Science 13(1981), pp. 109-136
  • [4] K. Jensen: Coloured Petri Nets and InvariantMethod, Theoretical Computer Science 14(1981), pp. 317-336
  • [5] A.Mazurkiewicz: Concurrent Program Schemes and their interpretation, DAIMI PB-78, ArhusUniv. Publ., July 1977
  • [6] A. Mazurkiewicz: Invariants of Concurrent Programs, Proc. of IFIP-INFOPOL Conf. on Information Processing, North-Holland Publ. Co., 1977, pp. 353-372
  • [7] A. Mazurkiewicz: Semantics of Concurrent Systems: A Modular Fixed Point Trace Approach, Institute of AppliedMathematics and Computer Science, University of Leiden, The Netherlands, Internal Report (1984)
  • [8] A. Mazurkiewicz: Introduction to Trace Theory, in: The Book of Traces, (V. Diekert and G. Rosenberg eds.),World Scientific 1995
  • [9] W. Reisig: Petri Nets, An Introduction, EATCS Monographs on Theoretical Computer Science, Springer Verlag, 1985
  • [10] R. Valk: Petri nets as token objects. An introduction to elementary object nets, In J. Desel and M. Silva, editors, Applications and Theory of Petri Nets 1998. Proceedings, volume 1420, pages 1-25. Springer-Verlag, 1998.
  • [11] J. Winkowski: An Algebraic Description of System Behaviours, TCS 21(1982), pp. 315-340
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS5-0010-0061
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.