Does My Service Have Partners?
From MaRDI portal
Recommendations
- Can I find a partner? Undecidability of partner existence for open nets
- Compositional Service Trees
- Continuous Petri Nets: Controllability and Control
- Analyzing compatibility of services via resource conformance
- A compositional framework to the specification of service protocols controllability and substitutability
Cites work
- scientific article; zbMATH DE number 1708021 (Why is no real title available?)
- scientific article; zbMATH DE number 177511 (Why is no real title available?)
- scientific article; zbMATH DE number 1302048 (Why is no real title available?)
- Can I find a partner? Undecidability of partner existence for open nets
- Formalizing web service choreographies
- Fundamental Approaches to Software Engineering
- Graph-Based Algorithms for Boolean Function Manipulation
- Lectures on Concurrency and Petri Nets
- Operating Guidelines for Finite-State Services
- Partial (set) 2-structures. I: Basic notions and the representation problems
- Supervisory Control of a Class of Discrete Event Processes
- The synthesis problem of Petri nets
- Web services. Concepts, architectures and applications
Cited in
(10)- Undecidability of accordance for open systems with unbounded message queues
- Trace- and failure-based semantics for responsiveness
- Can I find a partner? Undecidability of partner existence for open nets
- Relating fair testing and accordance for service replaceability
- Software engineering with Petri nets: a web service and agent perspective
- Analyzing compatibility of services via resource conformance
- Compositional separation of control flow and data flow
- Event-based functional decomposition
- Associative composition of components with double-sided interfaces
- Distributed synthesis of asynchronously communicating distributed process models
This page was built for publication: Does My Service Have Partners?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623824)