Bas Luttik

Orcid: 0000-0001-6710-8436

Affiliations:
  • Eindhoven University of Technology, Netherlands


According to our database1, Bas Luttik authored at least 77 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Four Formal Models of IEEE 1394 Link Layer.
Proceedings of the Proceedings Sixth Workshop on Models for Formal Analysis of Real Systems, 2024

Progress, Justness and Fairness in Modal μ-Calculus Formulae.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

Sequential Value Passing Yields a Kleene Theorem for Processes.
Proceedings of the Logics and Type Systems in Theory and Practice, 2024

2023
A Case in Point: Verification and Testing of a EULYNX Interface.
Formal Aspects Comput., March, 2023

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics.
Log. Methods Comput. Sci., 2023

Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract).
Proceedings of the Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, 2023

Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
ACM Trans. Comput. Log., 2022

On the Axiomatisability of Parallel Composition.
Log. Methods Comput. Sci., 2022

Safe and Secure Future AI-Driven Railway Technologies: Challenges for Formal Methods in Railway.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Practice, 2022

Supporting Railway Innovations with Formal Modelling and Verification.
Proceedings of the Formal Methods for Industrial Critical Systems, 2022

Decompositional Branching Bisimulation Minimisation of Monolithic Processes.
Proceedings of the Formal Aspects of Component Software - 18th International Conference, 2022

On the Axiomatisation of Branching Bisimulation Congruence over CCS.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021
The π-Calculus is Behaviourally Complete and Orbit-Finitely Executable.
Log. Methods Comput. Sci., 2021

Equivalence checking for weak bi-Kleene algebra.
Log. Methods Comput. Sci., 2021

In search of lost time: Axiomatising parallel composition in process algebras.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Off-the-Shelf Automated Analysis of Liveness Properties for Just Paths - (Extended Abstract).
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2021

A Formalisation of SysML State Machines in mCRL2.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2021

Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020
On the axiomatisability of priority III: Priority strikes again.
Theor. Comput. Sci., 2020

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence.
Log. Methods Comput. Sci., 2020

A process algebra with global variables.
Proceedings of the Proceedings Combined 27th International Workshop on Expressiveness in Concurrency and 17th Workshop on Structural Operational Semantics, 2020

Divergence-Preserving Branching Bisimilarity.
Proceedings of the Proceedings Combined 27th International Workshop on Expressiveness in Concurrency and 17th Workshop on Structural Operational Semantics, 2020

Off-the-shelf automated analysis of liveness properties for just paths.
Acta Informatica, 2020

Up-to Techniques for Branching Bisimilarity.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

On the Axiomatisability of Parallel Composition: A Journey in the Spectrum.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
On series-parallel pomset languages: Rationality, context-freeness and automata.
J. Log. Algebraic Methods Program., 2019

Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence.
Inf. Comput., 2019

Formal Modelling and Verification of an Interlocking Using mCRL2.
Proceedings of the Formal Methods for Industrial Critical Systems, 2019

Modelling and Analysing Software in mCRL2.
Proceedings of the Formal Aspects of Component Software - 16th International Conference, 2019

Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity.
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018
Modelling and Analysing ERTMS Hybrid Level 3 with the mCRL2 Toolset.
Proceedings of the Formal Methods for Industrial Critical Systems, 2018

2017
Sequential Composition in the Presence of Intermediate Termination (Extended Abstract).
Proceedings of the Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics, 2017

Sequential Composition in the Presence of Intermediate Termination.
CoRR, 2017

Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Divide and Congruence III: Stability & Divergence.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Unique parallel decomposition in branching and weak bisimulation semantics.
Theor. Comput. Sci., 2016

Preface to special issue: EXPRESS 2011.
Math. Struct. Comput. Sci., 2016

Expressiveness modulo bisimilarity of regular expressions with parallel composition.
Math. Struct. Comput. Sci., 2016

Unique Parallel Decomposition for the Pi-calculus.
Proceedings of the Proceedings Combined 23rd International Workshop on Expressiveness in Concurrency and 13th Workshop on Structural Operational Semantics, 2016

On the Executability of Interactive Computation.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Executable Behaviour and the π-Calculus (extended abstract).
Proceedings of the Proceedings 8th Interaction and Concurrency Experience, 2015

Evidence for Fixpoint Logic.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
Executable Behaviour and the $π$-Calculus.
CoRR, 2014

2013
Reactive Turing machines.
Inf. Comput., 2013

Proof Graphs for Parameterised Boolean Equation Systems.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
When Turing Meets Milner.
ERCIM News, 2012

Turing Meets Milner.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Unguardedness mostly means many solutions.
Theor. Comput. Sci., 2011

On the axiomatizability of priority II.
Theor. Comput. Sci., 2011

Computations and Interaction.
Proceedings of the Distributed Computing and Internet Technology, 2011

A process-theoretic approach to supervisory control theory.
Proceedings of the American Control Conference, 2011

2010
Towards model checking executable UML specifications in mCRL2.
Innov. Syst. Softw. Eng., 2010

Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract)
Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

Automated Verification of Executable UML Models.
Proceedings of the Formal Methods for Components and Objects - 9th International Symposium, 2010

2009
A finite equational base for CCS with left merge and communication merge.
ACM Trans. Comput. Log., 2009

Branching Bisimilarity with Explicit Divergence.
Fundam. Informaticae, 2009

Computation Tree Logic with Deadlock Detection
Log. Methods Comput. Sci., 2009

A Process-Theoretic Look at Automata.
Proceedings of the Fundamentals of Software Engineering, 2009

2008
The equational theory of prebisimilarity over basic CCS with divergence.
Inf. Process. Lett., 2008

On finite alphabets and infinite bases.
Inf. Comput., 2008

Finite Equational Bases for Fragments of CCS with Restriction and Relabelling.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2006
Guest editors' introduction: Special issue on Process Theory for Hybrid Systems.
J. Log. Algebraic Methods Program., 2006

Some Remarks on Definability of Process Graphs.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
Decomposition orders another generalisation of the fundamental theorem of arithmetic.
Theor. Comput. Sci., 2005

CCS with Hennessy's merge has no finite-equational axiomatization.
Theor. Comput. Sci., 2005

Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge.
Log. Methods Comput. Sci., 2005

Analyzing a <i>chi</i> model of a turntable system using Spin, CADP and Uppaal.
J. Log. Algebraic Methods Program., 2005

What is algebraic in process theory?
Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Reflections on a Geometry of Processes.
Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Stuttering Congruence for <i>chi</i>.
Proceedings of the Model Checking Software, 2005

Finite Equational Bases in Process Algebra: Results and Open Questions.
Proceedings of the Processes, 2005

2004
Remarks on Thatte's transformation of term rewriting systems.
Inf. Comput., 2004

2003
On the expressiveness of choice quantification.
Ann. Pure Appl. Log., 2003

A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2000
An <i>omega</i>-Complete Equational Specification of Interleaving.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1998
Editorial.
Formal Aspects Comput., 1998


  Loading...