Algorithmic Approach to the Length of the Words of String Token Petri Nets
Abstract
Keywords
Full Text:
PDFReferences
James Peterson, Petrinet theory and modeling of systems,Printice Hall,1997.
[Beulah Immanuel and K.Rangarajan, K.G.Subramanian, String – token Petri nets, Proceedings of the European Conferenceon Artificial Intelligence, One day workshop On symbolic networks at Valencia, Spain (2004) (submitted for publication).
Erkki Mäkinen, Ranking and unranking left szilard languages, Department of computer science, Series of publications A, A-1997-2, January 1997.
Erkki Mäkinen, on context-free derivations, Acta Universitatis Tamperensis 198,1985.
Etsuro Moriya, Associate language and derivational complexity of formal grammars and languages, Information and control 22 (1973), 139-162.
Martti Penttonen, On derivation languages corresponding to context-free grammars, Acta Inform.3(1974),285-291.
T. Murata, "Petri Nets: Properties, Analysis and Applications," an invited survey paper, Proceedings of the IEEE, Vol.77, No.4 pp.541-580, April, 1989.
J.Castellanos, C.Martin-vide, V.Mitrana, J.M.Sempere, “Networks of evolutionary processors”, Acta informatica (6-9), Vol.39(2003), 517-529.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.