Sciweavers

116 search results - page 2 / 24
» Composition and Decomposition in True-Concurrency
Sort
View
CSL
1992
Springer
13 years 11 months ago
Communicating Evolving Algebras
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
Paola Glavan, Dean Rosenzweig
APN
2010
Springer
14 years 9 days ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre
SEMWEB
2007
Springer
14 years 1 months ago
Formulation of Hierarchical Task Network Service (De)composition
The Hierarchical Task Network (HTN) planning method is conceived of as a useful method for Web service composition as well as classical task planning. However, there are no complet...
Seiji Koide, Hideaki Takeda
JWSR
2006
113views more  JWSR 2006»
13 years 7 months ago
Search Strategies for Automatic Web Service Composition
: We investigate architectural properties required for supporting automatic service composition. First, composable service architecture will be described, based on modeling Web ser...
Nikola Milanovic, Miroslaw Malek
FOSSACS
2011
Springer
12 years 11 months ago
Regularity and Context-Freeness over Word Rewriting Systems
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...
Didier Caucal, Dinh Trong Hieu