Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets (Q1665580): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4952938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal methods for web services. 9th international school on formal methods for the design of computer, communication, and software systems, SFM 2009, Bertinoro, Italy, June 1--6, 2009. Advanced lectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications and Theory of Petri Nets 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ePNK: An Extensible Petri Net Tool for PNML / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soundness of workflow nets: classification, decidability, and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural soundness of workflow nets is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Soundness Problem of Workflow Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Choice Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional semantics for open Petri nets based on deterministic processes / rank
 
Normal rank

Latest revision as of 11:48, 16 July 2024

scientific article
Language Label Description Also known as
English
Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets
scientific article

    Statements

    Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets (English)
    0 references
    0 references
    0 references
    27 August 2018
    0 references
    Summary: Interorganizational Workflow nets (IWF-nets) can well model many concurrent systems such as web service composition, in which multiple processes interact via sending/receiving messages. Compatibility of IWF-nets is a crucial criterion for the correctness of these systems. It guarantees that a system has no deadlock, livelock, or dead tasks. In our previous work we proved that the compatibility problem is PSPACE-complete for safe IWF-nets. This paper defines a subclass of IWF-nets that can model many cases about interactions. Necessary and sufficient condition is presented to decide their compatibility, and it depends on the net structures only. Finally, an algorithm is developed based on the condition.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references