562 search results - page 90 / 113 » A Concurrent Model for Linear Logic |
TOCL
2011
13 years 3 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
CONCUR
1997
Springer
14 years 26 days ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
MM
2006
ACM
14 years 2 months ago
2006
ACM
Periodic broadcast protocols enable the efficient streaming of highly popular media files to large numbers of concurrent clients. Most previous periodic broadcast protocols, howe...
IEICET
2006
13 years 8 months ago
2006
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making de...