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. Acta cybernetica, (14) 3. pp. 455-459. (2000)

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

Download (510kB)

Abstract

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
Page Range: pp. 455-459
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány
Additional Information: Bibliogr.: 459. p.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Apr. 05. 15:20
URI: http://acta.bibl.u-szeged.hu/id/eprint/12637

Actions (login required)

View Item View Item