Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource
From MaRDI portal
Publication:3452466
DOI10.1007/978-3-662-45730-6_1zbMath1428.68195MaRDI QIDQ3452466
V. 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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modelling multiagent systems with the help of generalized nets of active resources
- Soundness of workflow nets: classification, decidability, and analysis
- Structural soundness of workflow nets is decidable
- On the reachability problem for 5-dimensional vector addition systems
- Formalization of semantics of systems with unreliable agents by means of nets of active resources
- Resource Driven Automata Nets
- Cellular Resource-Driven Automata
- Analyzing Compatibility of Services via Resource Conformance
- Applications and Theory of Petri Nets 2004
- Applications and Theory of Petri Nets 2005