Pages that link to "Item:Q539433"

The following pages link to Soundness of workflow nets: classification, decidability, and analysis (Q539433):

Displaying 26 items.

• Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
• Partial order reduction for checking soundness of time workflow nets (Q507759) (← links)
• Sufficient conditions for the marked graph realisability of labelled transition systems (Q1623288) (← links)
• Discovering workflow nets using integer linear programming (Q1639990) (← links)
• Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets (Q1665580) (← links)
• Healthcare operation improvement based on simulation of cooperative resource preservation nets for none-consumable resources (Q1723059) (← links)
• Associative composition of components with double-sided interfaces (Q1733102) (← links)
• Boundedness of adaptive nets is decidable (Q1944126) (← links)
• Well-structuredness, safeness and soundness: a formal classification of BPMN collaborations (Q1996863) (← links)
• An approach based on timed Petri nets and tree encoding to implement search algorithms for a class of scheduling problems (Q2127112) (← links)
• Optimal directed hypergraph traversal with ant-colony optimisation (Q2200670) (← links)
• Complexity of the deadlock problem for Petri nets modeling resource allocation systems (Q2279727) (← links)
• A mathematical modelling for workflows (Q2299993) (← links)
• Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait (Q2798480) (← links)
• Reduction of Workflow Nets for Generalised Soundness Verification (Q2961558) (← links)
• Causal Nets: A Modeling Language Tailored towards Process Discovery (Q3090820) (← links)
• (Q3130542) (← links)
• (Q3384914) (← links)
• Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource (Q3452466) (← links)
• Discovery, Verification and Conformance of Workflows with Cancellation (Q3540385) (← links)
• Aggregating Causal Runs into Workflow Nets (Q4909355) (← links)
• Discovering Object-centric Petri Nets (Q4988950) (← links)
• Data Centric Workflows for Crowdsourcing (Q5100748) (← links)
• PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets (Q5100757) (← links)
• Free-choice Nets with Home Clusters are Lucent (Q5158668) (← links)
• Soundness of Timed-Arc Workflow Nets (Q5166756) (← links)