Can I find a partner? Undecidability of partner existence for open nets

DOI10.1016/J.IPL.2008.07.006zbMATH Open1191.68442OpenAlexW2010968096MaRDI QIDQ975497FDOQ975497

Authors: Peter Massuthe, Alexander Serebrenik, Natalia Sidorova, Karsten Wolf 

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.006

Recommendations

• Does My Service Have Partners?
• Soundness of workflow nets: classification, decidability, and analysis
• Undecidability of accordance for open systems with unbounded message queues
• Nested Petri Nets for Adaptive Process Modeling
• Undecidability of performance equivalence of Petri nets

zbMATH Keywords

theory of computationPetri netweb serviceopen netoperability

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Supervisory Control of a Class of Discrete Event Processes
• Title not available (Why is that?)
• Fundamental Approaches to Software Engineering
• Operating Guidelines for Finite-State Services

Cited In (4)

• Session types for safe web service orchestration
• Undecidability of accordance for open systems with unbounded message queues
• Deciding Substitutability of Services with Operating Guidelines
• Does My Service Have Partners?

Uses Software

• BPEL2PN
• BPEL2oWFN
• UMDES

This page was built for publication: Can I find a partner? Undecidability of partner existence for open nets

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