681 search results - page 127 / 137 » A Logic for True Concurrency |
104
click to vote
WSC
1997
14 years 11 months ago
1997
Distributed discrete event simulation techniques aim at an acceleration of the execution of a self-contained simulation model by the spatial decomposition of that model and the co...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
109
click to vote
LOGCOM
1998
14 years 9 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
119
click to vote
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
SIGSOFT
2009
ACM
15 years 10 months ago
2009
ACM
The trend towards processors with more and more parallel cores is increasing the need for software that can take advantage of parallelism. The most widespread method for writing p...