Model Checking Games for Branching Time Logics | 19 | 0.78 | 2002 |
Model Checking Fixed Point Logic with Chop | 392 | 13.54 | 2002 |
Focus Games for Satisfiability and Completeness of Temporal Logic | 22 | 1.14 | 2001 |
Games-Based Model Checking of Protocols: counting doesn't count | 0 | 0.34 | 2000 |
Diluting ACID | 3 | 0.57 | 1999 |
A More Committed Quorum-Based Three Phase Commit Protocol | 4 | 0.54 | 1998 |
Playing games and proving properties of concurrent systems | 0 | 0.34 | 1998 |
Decidability of bisimulation equivalence for normed pushdown processes | 44 | 2.24 | 1996 |
Bisimulation equivalence is decidable for all context-free processes | 108 | 8.32 | 1995 |
Actions speak louder than words: proving bisimilarity for context-free processes | 57 | 7.88 | 1991 |
Local model checking in the modal mu-calculus | 183 | 45.55 | 1991 |
CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus | 13 | 1.35 | 1989 |
Comparing Linear and Branching Time Temporal Logics | 23 | 3.95 | 1987 |
Weak and strong fairness in CCS | 41 | 5.81 | 1984 |
A fair calculus of communicating systems | 25 | 10.14 | 1983 |