A note on decidability of reachability for conditional Petri nets
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.
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2000
|
| Sorozat: | Acta cybernetica
14 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12637 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 455-459 |
| ISSN: | 0324-721X |