231 search results - page 31 / 47 » Concurrent Reachability Games |
LPNMR
2001
Springer
14 years 1 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
OOPSLA
1999
Springer
14 years 27 days ago
1999
Springer
Java programs perform many synchronization operations on data structures. Some of these synchronizations are unnecessary; in particular, if an object is reachable only by a single ...
PODC
1997
ACM
14 years 25 days ago
1997
ACM
Systems that store objects at a large number of sites require fault-tolerant and timely garbage collection. A popular technique is to trace each site independently using inter-sit...
ATVA
2006
Springer
14 years 11 days ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
IFIPTCS
2000
14 years 7 days ago
2000
Hierarchical state machines are finite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very l...