Zobrazeno 1 - 10
of 159
pro vyhledávání: '"Luttik, Bas"'
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 executions. Capturing that some property holds under such an assumption in a
Externí odkaz:
http://arxiv.org/abs/2407.08060
Autor:
Garavel, Hubert, Luttik, Bas
Publikováno v:
EPTCS 399, 2024, pp. 21-100
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 checking, detected a deadlock error in this IEEE standard. We present four
Externí odkaz:
http://arxiv.org/abs/2403.18723
Autor:
Baeten, Jos C. M., Luttik, Bas
Publikováno v:
EPTCS 387, 2023, pp. 114-131
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 the pendant of this theorem in a setting with interaction: the set of
Externí odkaz:
http://arxiv.org/abs/2309.07308
Autor:
Spronck, Myrthe, Luttik, Bas
We present process-algebraic models of multi-writer multi-reader safe, regular and atomic registers. We establish the relationship between our models and alternative versions presented in the literature. We use our models to formally analyse by model
Externí odkaz:
http://arxiv.org/abs/2307.05143
In this paper we investigate the equational theory of (the restriction, relabelling, and recursion free fragment of) CCS modulo rooted branching bisimilarity, which is a classic, bisimulation-based notion of equivalence that abstracts from internal c
Externí odkaz:
http://arxiv.org/abs/2206.13927
Autor:
Dubslaff, Clemens, Luttik, Bas
Publikováno v:
EPTCS 355, 2022
This volume contains the proceedings of MARS 2022, the fifth workshop on Models for Formal Analysis of Real Systems, held as part of ETAPS 2022, the European Joint Conferences on Theory and Practice of Software. The MARS workshops bring together rese
Externí odkaz:
http://arxiv.org/abs/2203.09299
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 1 (March 2, 2023) lmcs:9178
The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reac
Externí odkaz:
http://arxiv.org/abs/2203.01713
This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus on the recursion, relabelling and restriction free fragment of CCS and we discuss the soluti
Externí odkaz:
http://arxiv.org/abs/2105.00735
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (January 19, 2022) lmcs:7217
This paper studies the existence of finite equational axiomatisations of the interleaving parallel composition operator modulo the behavioural equivalences in van Glabbeek's linear time-branching time spectrum. In the setting of the process algebra B
Externí odkaz:
http://arxiv.org/abs/2102.11166
Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over ACP/CCS extended with the binary left and communication merge operators. Moller proved that auxiliary operators are necessary to obtain a finite axiomatisation
Externí odkaz:
http://arxiv.org/abs/2010.01943