50 search results - page 2 / 10 » Strict Sequential P-completeness |
TCS
2002
13 years 7 months ago
2002
In this paper we study a process algebra whose semantics is based on true concurrency. In our model, actions are defined in terms of the resources they need to execute, which allo...
IANDC
2006
13 years 7 months ago
2006
Fixpoint Logic with Chop extends the modal
WINE
2007
Springer
14 years 1 months ago
2007
Springer
We study sequential auctions for private value objects and unit-demand bidders using second-price sealed-bid rules. We analyze this scenario from the seller’s perspective and con...
LICS
2003
IEEE
14 years 25 days ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...