Algebraic Properties of Petri Net Languages and Codes

dc.contributor.advisor	Dömösi, Pál
dc.contributor.author	Yoshiyuki, Kunimochi
dc.contributor.department	Informatikai tudományok doktori iskola	hu
dc.date.accessioned	2010-04-29T06:29:27Z
dc.date.available	2010-04-29T06:29:27Z
dc.date.created	2009	hu_HU
dc.date.defended	2009-09-11
dc.date.issued	2010-04-29T06:29:27Z
dc.description.abstract	Petri nets are graphical and mathematical modeling tools applicable to many systems. They are promising tools for describing and studying information processing systems that are characterized as being concurrent, asynchronous, distributed, parallel, nondeterministic, and/or stochastic. However, in many applications modeling by itself is of limited practical use if one cannot analyze the modeled system. As means of gaining a better understanding of the Petri net model, the decidability and computational complexity of typical automata theoretic problems concerning Petri nets have been extensively investigated in the past four decades.	hu_HU
dc.format.extent	94	hu_HU
dc.identifier.uri	http://hdl.handle.net/2437/94895
dc.language.iso	en	hu_HU
dc.subject	Formális nyelvek	hu_HU
dc.subject	Formal Languages	hu_HU
dc.subject	Petri hálók	hu_HU
dc.subject	Petri nets	hu_HU
dc.subject.discipline	Informatikai tudományok	hu
dc.subject.sciencefield	Műszaki tudományok	hu
dc.title	Algebraic Properties of Petri Net Languages and Codes	hu_HU
dc.title.translated	Algebraic Properties of Petri Net Languages and Codes	hu_HU

Megjelenítve 1 - 4 (Összesen 4)