7289 search results - page 209 / 1458 » A Dependent Set Theory |
SIGMOD
2003
ACM
14 years 8 months ago
2003
ACM
Our goal is to understand redo recovery. We define an installation graph of operations in an execution, an ordering significantly weaker than conflict ordering from concurrency co...
CALCO
2007
Springer
14 years 2 months ago
2007
Springer
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
COORDINATION
2007
Springer
14 years 2 months ago
2007
Springer
We investigate, in a process algebraic setting, a new notion of compliance that we call strong service compliance: composed services are strong compliant if their composition is bo...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
Distributed Multi-Agent Systems (DMAS) such as supply chains functioning in highly dynamic environments need to achieve maximum overall utility during operation. The utility from ...
CSL
2001
Springer
14 years 25 days ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...