Boundedness of adaptive nets is decidable

DOI10.1016/j.ipl.2011.05.004zbMath1260.68274OpenAlexW1987606228MaRDI QIDQ1944126

Olivia Oanea

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.004

zbMATH Keywords

boundednessdecidabilitytheory of computationadaptive nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Soundness of workflow nets: classification, decidability, and analysis
• Recursive Petri nets
• Nested Nets for Adaptive Systems
• Hornets: Nets within Nets Combined with Net Algebra
• Nested Petri Nets for Adaptive Process Modeling
• Lectures on Concurrency and Petri Nets

This page was built for publication: Boundedness of adaptive nets is decidable