Soundness of timed-arc workflow nets

DOI10.1007/978-3-319-07734-5_4zbMATH Open1334.90064OpenAlexW2200666234MaRDI QIDQ5166756FDOQ5166756

Authors: José 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

Recommendations

• Soundness of timed-arc workflow nets in discrete and continuous-time semantics
• Soundness of workflow nets: classification, decidability, and analysis
• On soundness for time workflow nets
• Complexity of the soundness problem of workflow nets
• Applications and Theory of Petri Nets 2005

Mathematics Subject Classification ID

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

Cites Work

• TAPAAL 2.0: integrated development environment for timed-arc Petri nets
• Soundness of workflow nets: classification, decidability, and analysis

Cited In (5)

• On soundness for time workflow nets
• Soundness of workflow nets with reset ARCS
• Title not available (Why is that?)
• Soundness of timed-arc workflow nets in discrete and continuous-time semantics
• Decidable Classes of Unbounded Petri Nets with Time and Urgency

Uses Software

• TAPAAL

This page was built for publication: Soundness of timed-arc workflow nets

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