A note on decidability of reachability for conditional Petri nets

Authors

  • Ferucio Laurenţiu Țiplea
  • Cristina Bădărău

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.

Downloads

Download data is not yet available.

Downloads

Published

2000-01-01

How to Cite

Țiplea, F. L., & Bădărău, C. (2000). A note on decidability of reachability for conditional Petri nets. Acta Cybernetica, 14(3), 455–459. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3538

Issue

Vol. 14 No. 3 (2000)

Section

Regular articles

Most read articles by the same author(s)