Now you may compose temporal logic specifications H Barringer, R Kuiper, A Pnueli Proceedings of the sixteenth annual ACM symposium on Theory of computing, 51-63, 1984 | 314 | 1984 |

A really abstract concurrent model and its temporal logic H Barringer, R Kuiper, A Pnueli Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of …, 1986 | 217 | 1986 |

A partial order approach to branching time logic model checking R Gerth, R Kuiper, D Peled, W Penczek Proceedings Third Israel Symposium on the Theory of Computing and Systems …, 1995 | 120 | 1995 |

A partial order approach to branching time logic model checking R Gerth, R Kuiper, D Peled, W Penczek Information and Computation 150 (2), 132-152, 1999 | 88 | 1999 |

A modal approach to intentions, commitments and obligations: Intention plus commitment yields obligation F Dignum, JJC Meyer, RJ Wieringa, R Kuiper Deontic logic, agency and normative systems, 80-97, 1996 | 81 | 1996 |

Propositional temporal logics and equivalences U Goltz, R Kuiper, W Penczek International Conference on Concurrency Theory, 222-236, 1992 | 65 | 1992 |

Combining dynamic deontic logic and temporal logic for the specification of deadlines F Dignum, R Kuiper Proceedings of the Thirtieth Hawaii International Conference on System …, 1997 | 60 | 1997 |

Verification of object oriented programs using class invariants K Huizing, R Kuiper International Conference on Fundamental Approaches to Software Engineering …, 2000 | 57 | 2000 |

Hierarchical development of concurrent systems in a temporal logic framework H Barringer, R Kuiper International Conference on Concurrency, 35-61, 1984 | 56 | 1984 |

Fairness assumptions for CSP in a temporal logic framework R Kuiper, WP de Roever Mathematisch Centrum, Afdeling Informatica, 1982 | 49 | 1982 |

A compositional temporal approach to a CSP-like language H Barringer, R Kuiper, A Pnueli Formal Models of Programming, 207-227, 1985 | 43 | 1985 |

Partial-order reduction techniques for real-time model checking D Dams, R Gerth, B Knaack, R Kuiper Formal Aspects of Computing 10 (5-6), 469-482, 1998 | 40 | 1998 |

Improving partial order reductions for universal branching time properties W Penczek, M Szreter, R Gerth, R Kuiper Fundamenta Informaticae 43 (1-4), 245-267, 2000 | 39 | 2000 |

Traces and logic W Penczek, R Kuiper The book of Traces, 307-390, 1995 | 32 | 1995 |

Specifying deadlines with continuous time using deontic and temporal logic F Dignum, R Kuiper International Journal of Electronic Commerce 3 (2), 67-85, 1998 | 31 | 1998 |

Paradigms for real-time systems R Koymans, R Kuiper, E Zijlstra International Symposium on Formal Techniques in Real-Time and Fault-Tolerant …, 1988 | 27 | 1988 |

Specifying message passing and real-time systems with real-time temporal logic R Koymxms, R Kuiper, E Zijlstra ESPRIT'87 Achievements and Impact, 311, 1987 | 27 | 1987 |

An operational semantics for bonded nondeterminism equivalent to a denotational one R Kuiper | 25 | 1981 |

Partial order reductions preserving simulations W Penczek, R Gerth, R Kuiper, M Szreter Submitted for publication, 1999 | 24 | 1999 |

Interface refinement in reactive systems R Gerth, R Kuiper, J Segers International Conference on Concurrency Theory, 77-93, 1992 | 24 | 1992 |