1894 search results - page 138 / 379 » A TLA Proof System |
138
click to vote
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavi...
100
click to vote
FOSSACS
2006
Springer
15 years 7 months ago
2006
Springer
We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the `Stone dual' L ...
119
click to vote
ENTCS
2010
15 years 3 months ago
2010
It is not clear what a system for evidence-based common knowledge should look like if common knowledge is treated as a greatest fixed point. This paper is a preliminary step towar...
124
click to vote
ENTCS
2006
15 years 3 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
150
click to vote
PODC
2003
ACM
15 years 9 months ago
2003
ACM
Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allo...