×

zbMATH — the first resource for mathematics

The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. (English) Zbl 1362.68214
Proceedings of the 2012 27th annual ACM/IEEE symposium on logic in computer science, LICS 2012, Dubrovnik, Croatia, June 25–28, 2012. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4769-5). 355-364 (2012).

MSC:
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
03D20 Recursive functions and relations, subrecursive hierarchies
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q60 Specification and verification (program logics, model checking, etc.)
PDF BibTeX XML Cite
Full Text: DOI