Paper Info
Title
Set Algebra for Service Behavior: Applications and Constructions
Abstract
Compatibility of behavior , i.e. the correct ordering of messages, is one of the core aspects for the interaction between services as parts of an inter-organizational business process. In previous work, we proposed formal representations for service behavior (including Petri nets and service automata) and finite representations of sets thereof (operating guidelines ). In this article, we show how the basic set operations union, intersection, and complement, as well as membership and emptiness tests, can be implemented on finite representations of (typically infinite) sets of services. We motivate the operations by three examples of applications--service substitution, selection of behavior, and navigation in a behavioral registry.
Year
DOI
Venue
2009
10.1007/978-3-642-03848-8_14
BPM
Keywords
Field
DocType
finite representation,service behavior,petri net,behavioral registry,service automaton,formal representation,set algebra,basic set operations union,core aspect,emptiness test,service substitution,business process
Boolean function,Algebra of sets,Petri net,Business process,Computer science,Set operations,Automaton,Theoretical computer science,True quantified Boolean formula,Business Process Model and Notation
Conference
Volume
ISSN
Citations 
5701
0302-9743
7
PageRank 
References 
Authors
0.57
22
2
Name
Order
Citations
PageRank
Kathrin Kaschner1323.33
Karsten Wolf275742.53