620 search results - page 24 / 124 » Decidability Problems for Actor Systems |
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
CHI
2007
ACM
15 years 10 months ago
2007
ACM
While tactical command. control and communication environments might appear to be entirely instrumental in nature, they nevertheless provide a setting for social interaction. This...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
WWW
2010
ACM
15 years 4 months ago
2010
ACM
The Web of Data has emerged as a way of exposing structured linked data on the Web. It builds on the central building blocks of the Web (URIs, HTTP) and benefits from its simplic...