A note on decidability of reachability for conditional Petri nets

Țiplea Ferucio Laurenţiu and Bădărău Cristina: A note on decidability of reachability for conditional Petri nets. In: Acta cybernetica, (14) 3. pp. 455-459. (2000)

[thumbnail of cybernetica_014_numb_003_455-459.pdf]
Cikk, tanulmány, mű

Download (510kB) | Preview


The aim of this note is to prove that the reachability problem for Petri nets controlled by finite automata, in the sense of [5], is decidable.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2000
Volume: 14
Number: 3
ISSN: 0324-721X
Page Range: pp. 455-459
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38509/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: 459. p. ; ö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. 14. 11:42
URI: http://acta.bibl.u-szeged.hu/id/eprint/12637

Actions (login required)

View Item View Item