Decidability of k-Soundness for Workflow Nets with an Unbounded Resource

DOI10.1007/978-3-662-45730-6_1MaRDI QIDQ3452466zbMATH OpenOpenAlexFDO

Authors Vladimir A. Bashkin, Irina A. Lomazova

Publication date 12 November 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-45730-6_1

zbMATH Keywords

modelingPetri netssoundnessverificationworkflow

Mathematics Subject Classification ID

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

Recommendations

• Complexity of the soundness problem of bounded workflow nets
• Applications and Theory of Petri Nets 2004
• Applications and Theory of Petri Nets 2005
• Soundness of workflow nets: classification, decidability, and analysis
• Structural soundness of workflow nets is decidable
• Complexity of the soundness problem of workflow nets
• Verifying generalized soundness of workflow nets
• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations

Cites work

• Analyzing compatibility of services via resource conformance
• Applications and Theory of Petri Nets 2004
• Applications and Theory of Petri Nets 2005
• Cellular Resource-Driven Automata
• Checking properties of adaptive workflow nets
• Formalization of semantics of systems with unreliable agents by means of nets of active resources
• scientific article; zbMATH DE number 1708021 (Why is no real title available?)
• scientific article; zbMATH DE number 1304996 (Why is no real title available?)
• scientific article; zbMATH DE number 2064225 (Why is no real title available?)
• Modelling multiagent systems with the help of generalized nets of active resources
• On the reachability problem for 5-dimensional vector addition systems
• Resource Driven Automata Nets
• Soundness of workflow nets: classification, decidability, and analysis
• Structural soundness of workflow nets is decidable

Cited in

(4)

• Cost soundness for priced resource-constrained workflow nets
• Resource Bisimilarity in Petri Nets is Decidable
• Resource-constrained workflow nets
• Applications and Theory of Petri Nets 2004

This page was built for publication: Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource

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