Nonprimitive recursive complexity and undecidability for Petri net equivalences
Loading...
Downloads
0
Date issued
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Location
Není ve fondu ÚK
Signature
Abstract
Description
Delayed publication
Available after
Subject(s)
Petri-nets, decidability, complexity
Citation
Theoretical Computer Science. 2001, vol. 256, issues 1-2, p. 23-30.