Add to ORKGA Comparative Case-Study in Formal Verification Groote and the second author verified (a version of) the Bakery Protocol in $muCRL$. Their process-algebraic verification is rather complex compared to the protocol. Now the question is: How do other verification techniques perform on this protocol? In this paper, we present a new correctness proof by using I/O-automata theory and discuss the relative merits of both approaches. Subject classification
the formal verification of concurrent systems is usually seen as an example par excellence of the ap...
The high complexity of modern hardware and software systems necessitates the use of formal methods f...
Computation is employed to incredible success in a massive variety of applications, and yet it is di...
Groote and the second author verified (a version of) the Bakery Protocol in μCRL. Their process-alg...
A specification of the bakery protocol is given in ¯CRL. We provide a simple correctness criterion f...
A specification of the bakery protocol is given in μCRL. We provide a simple correctness criterion f...
textabstractA specification of a bakery protocol is given in $mu$CRL. We provide a simple correctnes...
henricwinl A specication of a bakery protocol is given in CRL We provide a simple correctness crite...
In this paper we give a specification of the so called Bakery protocol in an extension of the proces...
This paper reports on the first steps towards the formal verification of correctness proofs of real-...
We present a formal verification proof for the Alternating Bit Protocol in the specification languag...
AbstractWe show that verification techniques for timed automata based on the Alur and Dill region-gr...
The formal verification of concurrent systems is usually seen as an example par excellence of the ap...
In this paper we consider the frameworks of Process Al-gebra and I/O Automata and we apply both towa...
We present a specification of Lamport’s Bakery algorithm written in AsmL specification language. By ...
the formal verification of concurrent systems is usually seen as an example par excellence of the ap...
The high complexity of modern hardware and software systems necessitates the use of formal methods f...
Computation is employed to incredible success in a massive variety of applications, and yet it is di...
Groote and the second author verified (a version of) the Bakery Protocol in μCRL. Their process-alg...
A specification of the bakery protocol is given in ¯CRL. We provide a simple correctness criterion f...
A specification of the bakery protocol is given in μCRL. We provide a simple correctness criterion f...
textabstractA specification of a bakery protocol is given in $mu$CRL. We provide a simple correctnes...
henricwinl A specication of a bakery protocol is given in CRL We provide a simple correctness crite...
In this paper we give a specification of the so called Bakery protocol in an extension of the proces...
This paper reports on the first steps towards the formal verification of correctness proofs of real-...
We present a formal verification proof for the Alternating Bit Protocol in the specification languag...
AbstractWe show that verification techniques for timed automata based on the Alur and Dill region-gr...
The formal verification of concurrent systems is usually seen as an example par excellence of the ap...
In this paper we consider the frameworks of Process Al-gebra and I/O Automata and we apply both towa...
We present a specification of Lamport’s Bakery algorithm written in AsmL specification language. By ...
the formal verification of concurrent systems is usually seen as an example par excellence of the ap...
The high complexity of modern hardware and software systems necessitates the use of formal methods f...
Computation is employed to incredible success in a massive variety of applications, and yet it is di...