PL EN


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

Linear Properties of Zero-Safe Nets with Debit Tokens

Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
In this contribution we study an extension of zero-safe nets that allows to model cooperation scenarios. Since zero-safe nets cannot be represented as finite nets in general, we study an extension of the firing rule having a close connection to blind counter automatons and the theory of semi-flows. As a main result we obtain, that a representation can always be given as a finite P/T net - although our firing rule is an extension of the original one - i.e. it preserves all the events that have been allowed before.
Słowa kluczowe
Wydawca
Rocznik
Strony
329--342
Opis fizyczny
bibliogr. 11 poz.
Twórcy
autor
Bibliografia
  • [1] Brown, C., Gurr, D.: A categorical linear framework for Petri nets., Information and Computation, 122(2), 1995, 268-285.
  • [2] Bruni, R., Montanari, U.: Zero-Safe Nets - or transition synchronization made simple, Electronic Notes in Theoretical Computer Science: Proceedings of EXPRESS'97, 4th workshop on Expressiveness in Concurrency, 7, 1997, 1-19.
  • [3] Bruni, R., Montanari, U.: Zero-safe nets: The individual token approach, WADT (F. Parisi-Presicce, Ed.), 1376, Springer-Verlag, 1997, ISBN 3-540-64299-4.
  • [4] Bruni, R., Montanari, U.: Executing Transactions in Zero-Safe Nets, Conference on Application and Theory of Petri Nets (ICATPN 2000) (M. Nielsen, D. Simpson, Eds.), 1825, Springer-Verlag, 2000.
  • [5] Bruni, R., Montanari, U.: Zero-Safe Nets: Comparing the Collective and Individual Token Approaches, Inf. Comput., 156(1-2), 2000, 46-89.
  • [6] Greibach, S. A.: Remarks on Blind and Partially Blind One-Way Multicounter Machines, Theoretical Computer Science, 7, 1978, 311-324.
  • [7] Gunter, C., Gehlot, V.: Nets as Tensor theories, Proceeding of the 10th International Conference on Application and Theory of Petri Nets (W. Reisig, K. Voss, Eds.), 483, Springer-Verlag, June 1989.
  • [8] Marti-Oliet, N., Meseguer, J.: From Petri nets to linear logic through categories: a survey, Foundations of computer science, 2, 1991, 297-399.
  • [9] Meseguer, J., Montanari, U.: Petri nets are monoids, Information and Computation, 88(2), October 1990, 105-155.
  • [10] Silva, M., Teruel, E., Colom, J. M.: Linear Algebraic and Linear Programming Techniques for the Analysis of Place/Transition Net Systems, Lecture Notes in Computer Science: Lectures on Petri Nets I: Basic Models (W. Reisig, G. Rozenberg, Eds.), 1491, Springer-Verlag, 1998.
  • [11] Stotts, D., Godfrey, P.: Place/transition nets with debit arcs, Information Processing Letters, 41, 1992.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS5-0016-0022
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ć.