Abstract
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 dead). Our representation is an extension of the existing notion of an operating guideline which only cared about deadlock freedom. We further present an algorithm to decide whether a service M matches with the extended operating guideline of N. © 2008 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Stahl, C., & Wolf, K. (2008). Covering places and transitions in open nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5240 LNCS, pp. 116–131). Springer Verlag. https://doi.org/10.1007/978-3-540-85758-7_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
