Boundedness of adaptive nets is decidable

DOI10.1016/J.IPL.2011.05.004MaRDI QIDQ1944126zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Decidability problems of a basic class of object nets
• Boundedness problems for jumping Petri nets
• scientific article; zbMATH DE number 1405652
• scientific article; zbMATH DE number 1522994
• On Compositionality of Boundedness and Liveness for Nested Petri Nets

Cites work

• scientific article; zbMATH DE number 1522994 (Why is no real title available?)
• Checking properties of adaptive workflow nets
• Hornets: Nets within Nets Combined with Net Algebra
• Lectures on Concurrency and Petri Nets
• Nested Nets for Adaptive Systems
• Nested Petri Nets for Adaptive Process Modeling
• Recursive Petri nets
• Soundness of workflow nets: classification, decidability, and analysis
• The reachability problem for object nets

Cited in

(1)

• scientific article; zbMATH DE number 1405652 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944126)