We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
: A large variety of emerging Computational Grid applications require versioning services to support effective management of constantly changing datasets and implementations of dat...
As a means of modeling typical system behavior, we present a description technique for business processes derived from data flow nets and provide it with a formal semantics based ...
2 This paper analyzes the structural features of naturally-occurring extended explanations and argues that current generation methodologies are inadequate for determining high-leve...
David J. Mooney, Sandra Carberry, Kathleen F. McCo...