12 citations · 88 across the 34 of their papers we have counts for
37 papers
Just Verification of Mutual Exclusion Algorithms with (Non-)Blocking and (Non-)Atomic Registers
Rob van Glabbeek, Bas Luttik, Myrthe Spronck
We verify the correctness of a variety of mutual exclusion algorithms through model checking. We look at algorithms where communication is via shared read/write registers, where th…
Just Verification of Mutual Exclusion Algorithms
Rob van Glabbeek, Bas Luttik, Myrthe Spronck
We verify the correctness of a variety of mutual exclusion algorithms through model checking. We look at algorithms where communication is via shared read/write registers, where th…
The Queue Automaton Revisited
Jos C. M. Baeten, Bas Luttik
We consider the computational model of the Queue Automaton. An old result is that the deterministic queue automaton is equally expressive as the Turing machine. We introduced the R…
Progress, Justness and Fairness in Modal -Calculus Formulae
Myrthe Spronck, Bas Luttik, Tim Willemse
When verifying liveness properties on a transition system, it is often necessary to discard spurious violating paths by making assumptions on which paths represent realistic execut…
Four Formal Models of IEEE 1394 Link Layer
Hubert Garavel, Bas Luttik
We revisit the IEEE 1394 high-performance serial bus ("FireWire"), which became a success story in formal methods after three PhD students, by using process algebra and model check…
Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract)
Jos C. M. Baeten, Bas Luttik
A classical theorem states that the set of languages given by a pushdown automaton coincides with the set of languages given by a context-free grammar. In previous work, we proved…