680 search results - page 74 / 136 » Complexity of Strict Implication |
ICFEM
1997
Springer
14 years 2 months ago
1997
Springer
A real-time computer system is a system that must perform its functions within specified time bounds. These systems are generally characterized by complex interactions with the en...
STACS
1994
Springer
14 years 2 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Modern microprocessors have sacrificed the exactness of exceptions for improved performance long ago. This is a side effect of reordering instructions so that the micropr...
CONCUR
2006
Springer
14 years 1 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
PRICAI
2000
Springer
14 years 1 months ago
2000
Springer
It is possible to define conversation policies, such as communication or dialogue protocols, that are based strictly on what messages and, respectively, what performatives may foll...