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

DOI10.1016/j.ipl.2008.07.006zbMath1191.68442OpenAlexW2010968096MaRDI QIDQ975497

Natalia Sidorova, Alexander Serebrenik, Peter Massuthe, Karsten Schmidt

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

zbMATH Keywords

Petri nettheory of computationweb serviceopen netoperability

Mathematics Subject Classification ID

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

Related Items (4)

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

Uses Software

• BPEL2PN
• BPEL2oWFN
• UMDES

Cites Work

• Unnamed Item
• Operating Guidelines for Finite-State Services
• Supervisory Control of a Class of Discrete Event Processes
• Fundamental Approaches to Software Engineering

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