Soundness of Timed-Arc Workflow Nets

DOI10.1007/978-3-319-07734-5_4zbMath1334.90064OpenAlexW2200666234MaRDI QIDQ5166756

Jose Antonio Mateo, Mathias Grund Sørensen, Jiří Srba

Publication date: 8 July 2014

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07734-5_4

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of organizations, manpower planning in operations research (90B70)

Related Items

Decidable Classes of Unbounded Petri Nets with Time and Urgency

Uses Software

• TAPAAL

Cites Work

• Soundness of workflow nets: classification, decidability, and analysis
• TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets