Tytuł artykułu
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
We extend the investigation of synthesis and analysis of net structures and transition graphs to such with inhibitor relations, and show that the results obtained for the simpler case can be extended, too.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
1--7
Opis fizyczny
Bibliogr. 6 poz., wykr.
Twórcy
autor
autor
- Department Informatik, MIN-Fakultät, Universit¨at Hamburg, Vogt-Kölln-Straße 30. D-22527 Hamburg, Germany, kudlek@informatik.uni-hamburg.de
Bibliografia
- [1] Tilak Agerwala, Michael J. Flynn: Comments on Capabilities, Limitations and "Correctness" of Petri Nets., Proc. of First Annual Symposium on Computer Architecture, New York 1973, pp. 81-86, 1973.
- [2] Nadia Busi, G.Michele Pinna: Synthesis with Inhibitor Arcs., Proc. CONCUR'97, LNCS 1243, pp. 151-165, 1997.
- [3] Ludwik Czaja: Boolean Algebra of Nets, their Synthesis and Analysis. Fundamenta Informaticae 85, No. 1-4, pp. 89-95, 2008.
- [4] Ludwik Czaja, Manfred Kudlek: Synthesis and Analysis of Net Structures and Transition Graphs., Fundamenta Informaticae 93, No 1-3, pp. 97-110, 2009.
- [5] Wolfgang Reisig: Petri Nets - An Introduction., EATCS Monographs 5, Springer, 1985.
- [6] Rüdiger Valk: Extension and Intension of Actions., in Concurrency and Nets, eds. K. Voss, H.J. Genrich, G. Rozenberg, pp. 575-584, Springer, 1987.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS8-0010-0055