Limited codes associated with Petri nets

Tanaka Genjiro: Limited codes associated with Petri nets. In: Acta cybernetica, (19) 1. pp. 217-230. (2009)

[thumbnail of actacyb_19_1_2009_14.pdf]
Cikk, tanulmány, mű

Download (167kB) | Preview


The purpose of this paper is to investigate the relationship between limited codes and Petri nets. The set M of all positive firing sequences which start from the positive initial marking μ of a Petri net and reach μ itself forms a pure monoid M whose base is a bifix code. Especially, the set of all elements in M which pass through only positive markings forms a submonoid N of M. Also N has a remarkable property that N is pure. Our main interest is in the base D of N. The family of pure monoids contains the family of very pure monoids, and the base of a very pure monoid is a circular code. Therefore, we can expect that D may be a limited code. In this paper, we examine "small" Petri nets and discuss under what conditions D is limited.

Item Type: Article
Heading title: Regular papers
Journal or Publication Title: Acta cybernetica
Date: 2009
Volume: 19
Number: 1
ISSN: 0324-721X
Page Range: pp. 217-230
Language: English
Place of Publication: Szeged
Related URLs:
DOI: 10.14232/actacyb.19.1.2009.14
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 229-230. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 17. 10:23

Actions (login required)

View Item View Item