Bas Luttik
Bas Luttik
Assistant Professor of Computer Science, Eindhoven University of Technology
Verified email at tue.nl - Homepage
Title
Cited by
Cited by
Year
Branching bisimilarity with explicit divergence
R Van Glabbeek, B Luttik, N Trcka
arXiv preprint arXiv:0812.3068, 2008
842008
Description and formal specification of the link layer of P1394
SP Luttik
Centrum voor Wiskunde en Informatica, 1997
731997
Towards model checking executable UML specifications in mCRL2
HH Hansen, J Ketema, B Luttik, MR Mousavi, J Van De Pol
Innovations in Systems and Software Engineering 6 (1), 83-90, 2010
572010
Analyzing a χ model of a turntable system using Spin, CADP and Uppaal
E Bortnik, N Trčka, AJ Wijs, B Luttik, JM van de Mortel-Fronczak, ...
The Journal of Logic and Algebraic Programming 65 (2), 51-104, 2005
572005
Specification of Rewriting Strategies
SP Luttik, E Visser
Proceedings of the 2nd International Workshop on the Theory and Practice of …, 1997
511997
Finite equational bases in process algebra: Results and open questions
L Aceto, W Fokkink, A Ingólfsdóttir, B Luttik
Processes, terms and cycles: steps on the road to infinity, 338-367, 2005
502005
A process-theoretic approach to supervisory control theory
JCM Baeten, DA Van Beek, B Luttik, J Markovski, JE Rooda
Proceedings of the 2011 American Control Conference, 4496-4501, 2011
422011
Choice quantification in process algebra
SP Luttik
Universiteit van Amsterdam [Host], 2002
402002
Reactive Turing machines
J Baeten, B Luttik, P Van Tilburg
Information and Computation 231, 143-166, 2013
322013
Automated verification of executable UML models
HH Hansen, J Ketema, B Luttik, MR Mousavi, J Van De Pol, ...
International Symposium on Formal Methods for Components and Objects, 225-250, 2010
312010
An ω-complete equational specification of interleaving
WJ Fokkink, SP Luttik
International Colloquium on Automata, Languages, and Programming, 729-743, 2000
312000
Decomposition orders—another generalisation of the fundamental theorem of arithmetic
B Luttik, V Van Oostrom
Theoretical Computer Science 335 (2-3), 147-186, 2005
28*2005
CCS with Hennessy's merge has no finite-equational axiomatization
L Aceto, W Fokkink, A Ingólfsdóttir, B Luttik
Theoretical Computer Science 330 (3), 377-405, 2005
272005
A finite equational base for CCS with left merge and communication merge
L Aceto, W Fokkink, A Ingólfsdóttir, B Luttik
ACM Transactions on Computational Logic (TOCL) 10 (1), 1-26, 2009
262009
Computation Tree Logic with Deadlock Detection
R Glabbeek, B Luttik, N Trcka
Logical Methods in Computer Science 5 (4: 5), 1, 2009
26*2009
A process-theoretic look at automata
JCM Baeten, PJL Cuijpers, B Luttik, PJA Van Tilburg
International Conference on Fundamentals of Software Engineering, 1-33, 2009
232009
On finite alphabets and infinite bases
T Chen, W Fokkink, B Luttik, S Nain
Information and Computation 206 (5), 492-519, 2008
202008
Expressiveness modulo bisimilarity of regular expressions with parallel composition
JCM Baeten, B Luttik, T Muller, P Van Tilburg
Mathematical Structures in Computer Science 26 (6), 933-968, 2016
192016
Undecidability and completeness results for process algebras with alternative quantification over data. Report SEN-R9806, CWI, The Netherlands
JF Groote, SP Luttik
191998
Modelling and analysing ERTMS hybrid level 3 with the mCRL2 toolset
M Bartholomeus, B Luttik, T Willemse
International Workshop on Formal Methods for Industrial Critical Systems, 98-114, 2018
162018
The system can't perform the operation now. Try again later.
Articles 1–20