Workflow management: models, methods, and systems
Workflow management: models, methods, and systems
WIDE-a distributed architecture for workflow management
RIDE '97 Proceedings of the 7th International Workshop on Research Issues in Data Engineering (RIDE '97) High Performance Database Management for Large-Scale Applications
Business artifacts: An approach to operational specification
IBM Systems Journal
Static analysis of active XML systems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Artifact-Centric Business Process Models: Brief Survey of Research Results and Challenges
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Structured communication-centred programming for web services
ESOP'07 Proceedings of the 16th European conference on Programming
Document Based Modeling of Web Services Choreographies Using Active XML
ICWS '10 Proceedings of the 2010 IEEE International Conference on Web Services
A framework for document-driven workflow systems
BPM'05 Proceedings of the 3rd international conference on Business Process Management
| Hi-index | 0.00 |
Before using a service in a composite framework, designers must ensure that it is compatible with the needs of the application. The inputs and outputs must comply with the intended ranges of data in the composite framework, and the service must eventually return a value. This paper addresses compatibility for modules described with document-based workflow nets, that can depict the semantics of active XML (AXML) systems, a language for Web Services design. The behavior of non-recursive AXML specifications with finite data can be represented as Docnets, i.e., finite labeled Petri nets carrying information on document types they transform. Compatibility of docnet modules is characterized in terms of a decidable reachability property in the underlying net. Finally, we show the distributivity of compatibility over composition, which allows a faster semi-decision algorithm to verify compatibility between sets of modules.