default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBas Luttik
S. P. Luttik
Person information
- affiliation: Eindhoven University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c47]Jos C. M. Baeten, Bas Luttik:
Sequential Value Passing Yields a Kleene Theorem for Processes. Logics and Type Systems in Theory and Practice 2024: 1-16- [c46]Myrthe S. C. Spronck, Bas Luttik, Tim A. C. Willemse:
Progress, Justness and Fairness in Modal μ-Calculus Formulae. CONCUR 2024: 38:1-38:22 - [c45]Hubert Garavel, Bas Luttik:
Four Formal Models of IEEE 1394 Link Layer. MARS@ETAPS 2024: 21-100 - [i22]Myrthe S. C. Spronck, Bas Luttik, Tim A. C. Willemse:
Progress, Justness and Fairness in Modal μ-Calculus Formulae. CoRR abs/2407.08060 (2024) - 2023
- [j32]Mark Bouwman
, Djurre van der Wal, Bas Luttik, Mariëlle Stoelinga, Arend Rensink:
A Case in Point: Verification and Testing of a EULYNX Interface. Formal Aspects Comput. 35(1): 2:1-2:38 (2023) - [j31]Jos C. M. Baeten, Cesare Carissimo, Bas Luttik:
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. Log. Methods Comput. Sci. 19(1) (2023) - [c44]Myrthe S. C. Spronck, Bas Luttik:
Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers. CONCUR 2023: 5:1-5:17 - [c43]Jos C. M. Baeten, Bas Luttik:
Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract). EXPRESS/SOS 2023: 114-131 - [i21]Myrthe S. C. Spronck, Bas Luttik:
Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers. CoRR abs/2307.05143 (2023) - 2022
- [j30]Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen:
On the Axiomatisability of Parallel Composition. Log. Methods Comput. Sci. 18(1) (2022) - [j29]Luca Aceto, Valentina Castiglioni, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ACM Trans. Comput. Log. 23(4): 22:1-22:56 (2022) - [c42]Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik:
On the Axiomatisation of Branching Bisimulation Congruence over CCS. CONCUR 2022: 6:1-6:18 - [c41]Mark Bouwman, Maurice Laveaux, Bas Luttik, Tim A. C. Willemse:
Decompositional Branching Bisimulation Minimisation of Monolithic Processes. FACS 2022: 161-182 - [c40]Bas Luttik:
Supporting Railway Innovations with Formal Modelling and Verification. FMICS 2022: 8-11 - [c39]Monika Seisenberger, Maurice H. ter Beek, Xiuyi Fan, Alessio Ferrari, Anne E. Haxthausen, Phillip James, Andrew Lawrence, Bas Luttik, Jaco van de Pol, Simon Wimmer:
Safe and Secure Future AI-Driven Railway Technologies: Challenges for Formal Methods in Railway. ISoLA (4) 2022: 246-268 - [e4]Clemens Dubslaff, Bas Luttik:
Proceedings Fifth Workshop on Models for Formal Analysis of Real Systems, MARS@ETAPS 2022, Munich, Germany, 2nd April 2022. EPTCS 355, 2022 [contents] - [i20]Jos C. M. Baeten, Cesare Carissimo, Bas Luttik:
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. CoRR abs/2203.01713 (2022) - [i19]Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik:
On the Axiomatisation of Branching Bisimulation Congruence over CCS. CoRR abs/2206.13927 (2022) - 2021
- [j28]Bas Luttik, Fei Yang:
The π-Calculus is Behaviourally Complete and Orbit-Finitely Executable. Log. Methods Comput. Sci. 17(1) (2021) - [j27]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
Equivalence checking for weak bi-Kleene algebra. Log. Methods Comput. Sci. 17(3) (2021) - [c38]Jos C. M. Baeten, Cesare Carissimo, Bas Luttik:
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics. CALCO 2021: 8:1-8:16 - [c37]Luca Aceto, Valentina Castiglioni, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition? CSL 2021: 8:1-8:17 - [c36]Mark Bouwman, Bas Luttik, Djurre van der Wal:
A Formalisation of SysML State Machines in mCRL2. FORTE 2021: 42-59 - [c35]Mark Bouwman, Bas Luttik, Tim A. C. Willemse:
Off-the-Shelf Automated Analysis of Liveness Properties for Just Paths - (Extended Abstract). FORTE 2021: 182-187 - [c34]Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik:
In search of lost time: Axiomatising parallel composition in process algebras. LICS 2021: 1-14 - [i18]Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen:
On the Axiomatisability of Parallel Composition. CoRR abs/2102.11166 (2021) - [i17]Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik:
In search of lost time: Axiomatising parallel composition in process algebras. CoRR abs/2105.00735 (2021) - 2020
- [j26]Mark Bouwman, Bas Luttik, Tim A. C. Willemse:
Off-the-shelf automated analysis of liveness properties for just paths. Acta Informatica 57(3-5): 551-590 (2020) - [j25]Rob van Glabbeek, Bas Luttik, Linda Spaninks:
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence. Log. Methods Comput. Sci. 16(3) (2020) - [j24]Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen:
On the axiomatisability of priority III: Priority strikes again. Theor. Comput. Sci. 837: 223-246 (2020) - [c33]Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen:
On the Axiomatisability of Parallel Composition: A Journey in the Spectrum. CONCUR 2020: 18:1-18:22 - [c32]Rick Erkens, Jurriaan Rot, Bas Luttik:
Up-to Techniques for Branching Bisimilarity. SOFSEM 2020: 285-297 - [c31]Bas Luttik:
Divergence-Preserving Branching Bisimilarity. EXPRESS/SOS 2020: 3-11 - [c30]Mark Bouwman, Bas Luttik, Wouter Schols, Tim A. C. Willemse:
A process algebra with global variables. EXPRESS/SOS 2020: 33-50 - [i16]Rick Erkens, Jurriaan Rot, Bas Luttik:
Up-to Techniques for Branching Bisimilarity. CoRR abs/2001.08944 (2020) - [i15]Luca Aceto, Valentina Castiglioni, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition? CoRR abs/2010.01943 (2020)
2010 – 2019
- 2019
- [j23]Wan J. Fokkink, Rob van Glabbeek, Bas Luttik:
Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence. Inf. Comput. 268 (2019) - [j22]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
On series-parallel pomset languages: Rationality, context-freeness and automata. J. Log. Algebraic Methods Program. 103: 130-153 (2019) - [c29]Astrid Belder, Bas Luttik, Jos C. M. Baeten:
Sequencing and Intermediate Acceptance: Axiomatisation and Decidability of Bisimilarity. CALCO 2019: 11:1-11:22 - [c28]Jan Friso Groote, Jeroen J. A. Keiren, Bas Luttik, Erik P. de Vink, Tim A. C. Willemse:
Modelling and Analysing Software in mCRL2. FACS 2019: 25-48 - [c27]Mark Bouwman, Bob Janssen, Bas Luttik:
Formal Modelling and Verification of an Interlocking Using mCRL2. FMICS 2019: 22-39 - [i14]Wan J. Fokkink, Rob van Glabbeek, Bas Luttik:
Divide and Congruence III: From Decomposition of Modal Formulas to Preservation of Stability and Divergence. CoRR abs/1908.06550 (2019) - 2018
- [c26]Maarten Bartholomeus, Bas Luttik, Tim A. C. Willemse:
Modelling and Analysing ERTMS Hybrid Level 3 with the mCRL2 Toolset. FMICS 2018: 98-114 - [i13]Rob J. van Glabbeek, Bas Luttik, Linda Spaninks:
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence. CoRR abs/1801.01180 (2018) - [i12]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
Equivalence checking for weak bi-Kleene algebra. CoRR abs/1807.02102 (2018) - [i11]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
On Series-Parallel Pomset Languages: Rationality, Context-Freeness and Automata. CoRR abs/1812.03058 (2018) - 2017
- [c25]Wan J. Fokkink, Rob J. van Glabbeek, Bas Luttik:
Divide and Congruence III: Stability & Divergence. CONCUR 2017: 15:1-15:16 - [c24]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages. CONCUR 2017: 25:1-25:16 - [c23]Jos C. M. Baeten, Bas Luttik, Fei Yang:
Sequential Composition in the Presence of Intermediate Termination (Extended Abstract). EXPRESS/SOS 2017: 1-17 - [i10]Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages. CoRR abs/1704.07199 (2017) - [i9]Jos C. M. Baeten, Bas Luttik, Fei Yang:
Sequential Composition in the Presence of Intermediate Termination. CoRR abs/1706.08401 (2017) - 2016
- [j21]Jos C. M. Baeten, Bas Luttik, Tim Muller, Paul van Tilburg:
Expressiveness modulo bisimilarity of regular expressions with parallel composition. Math. Struct. Comput. Sci. 26(6): 933-968 (2016) - [j20]Bas Luttik, Frank D. Valencia:
Preface to special issue: EXPRESS 2011. Math. Struct. Comput. Sci. 26(8): 1351 (2016) - [j19]Bas Luttik:
Unique parallel decomposition in branching and weak bisimulation semantics. Theor. Comput. Sci. 612: 29-44 (2016) - [c22]Bas Luttik, Fei Yang:
On the Executability of Interactive Computation. CiE 2016: 312-322 - [c21]Matias David Lee, Bas Luttik:
Unique Parallel Decomposition for the Pi-calculus. EXPRESS/SOS 2016: 45-59 - [i8]Bas Luttik, Fei Yang:
On the Executability of Interactive Computation. CoRR abs/1601.01546 (2016) - 2015
- [c20]Sjoerd Cranen, Bas Luttik, Tim A. C. Willemse:
Evidence for Fixpoint Logic. CSL 2015: 78-93 - [c19]Bas Luttik, Fei Yang:
Executable Behaviour and the π-Calculus (extended abstract). ICE 2015: 37-52 - 2014
- [i7]Bas Luttik, Fei Yang:
Executable Behaviour and the $π$-Calculus. CoRR abs/1410.4512 (2014) - 2013
- [j18]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Reactive Turing machines. Inf. Comput. 231: 143-166 (2013) - [c18]Sjoerd Cranen, Bas Luttik, Tim A. C. Willemse:
Proof Graphs for Parameterised Boolean Equation Systems. CONCUR 2013: 470-484 - [e3]Johannes Borgström, Bas Luttik:
Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics, EXPRESS/SOS 2013, Buenos Aires, Argentina, 26th August, 2013. EPTCS 120, 2013 [contents] - 2012
- [c17]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Turing Meets Milner. CONCUR 2012: 1-20 - [c16]Bas Luttik:
Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics. IFIP TCS 2012: 250-264 - [e2]Bas Luttik, Michel A. Reniers:
Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, EXPRESS/SOS 2012, Newcastle upon Tyne, UK, September 3, 2012. EPTCS 89, 2012 [contents] - [i6]Bas Luttik:
Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics. CoRR abs/1205.2117 (2012) - [i5]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
When Turing Meets Milner. ERCIM News 2012(91) (2012) - 2011
- [j17]Luca Aceto, Taolue Chen, Anna Ingólfsdóttir, Bas Luttik, Jaco van de Pol:
On the axiomatizability of priority II. Theor. Comput. Sci. 412(28): 3035-3044 (2011) - [j16]Jos C. M. Baeten, Bas Luttik:
Unguardedness mostly means many solutions. Theor. Comput. Sci. 412(28): 3090-3100 (2011) - [c15]Jos C. M. Baeten, D. A. van Beek, Bas Luttik, Jasen Markovski, Jacobus E. Rooda:
A process-theoretic approach to supervisory control theory. ACC 2011: 4496-4501 - [c14]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Reactive Turing Machines. FCT 2011: 348-359 - [c13]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Computations and Interaction. ICDCIT 2011: 35-54 - [e1]Bas Luttik, Frank Valencia:
Proceedings 18th International Workshop on Expressiveness in Concurrency, EXPRESS 2011, Aachen, Germany, 5th September 2011. EPTCS 64, 2011 [contents] - [i4]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Reactive Turing Machines. CoRR abs/1104.1738 (2011) - 2010
- [j15]Helle Hvid Hansen, Jeroen Ketema, Bas Luttik, Mohammad Reza Mousavi, Jaco van de Pol:
Towards model checking executable UML specifications in mCRL2. Innov. Syst. Softw. Eng. 6(1-2): 83-90 (2010) - [c12]Helle Hvid Hansen, Jeroen Ketema, Bas Luttik, Mohammad Reza Mousavi, Jaco van de Pol, Osmar Marchi dos Santos:
Automated Verification of Executable UML Models. FMCO 2010: 225-250 - [c11]Jos C. M. Baeten, Bas Luttik, Tim Muller, Paul van Tilburg:
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract). EXPRESS 2010: 1-15
2000 – 2009
- 2009
- [j14]Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
Computation Tree Logic with Deadlock Detection. Log. Methods Comput. Sci. 5(4) (2009) - [j13]Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
Branching Bisimilarity with Explicit Divergence. Fundam. Informaticae 93(4): 371-392 (2009) - [j12]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
A finite equational base for CCS with left merge and communication merge. ACM Trans. Comput. Log. 10(1): 6:1-6:26 (2009) - [c10]Jos C. M. Baeten, Pieter J. L. Cuijpers, Bas Luttik, P. J. A. van Tilburg:
A Process-Theoretic Look at Automata. FSEN 2009: 1-33 - 2008
- [j11]Taolue Chen, Wan J. Fokkink, Bas Luttik, Sumit Nain:
On finite alphabets and infinite bases. Inf. Comput. 206(5): 492-519 (2008) - [j10]Luca Aceto, Silvio Capobianco, Anna Ingólfsdóttir, Bas Luttik:
The equational theory of prebisimilarity over basic CCS with divergence. Inf. Process. Lett. 108(5): 284-289 (2008) - [c9]Luca Aceto, Anna Ingólfsdóttir, Bas Luttik, Paul van Tilburg:
Finite Equational Bases for Fragments of CCS with Restriction and Relabelling. IFIP TCS 2008: 317-332 - [i3]Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
Branching Bisimilarity with Explicit Divergence. CoRR abs/0812.3068 (2008) - 2006
- [j9]Bas Luttik:
What is Algebraic in Process Theory? Bull. EATCS 88: 66-83 (2006) - [j8]Jos C. M. Baeten, S. P. Luttik:
Guest editors' introduction: Special issue on Process Theory for Hybrid Systems. J. Log. Algebraic Methods Program. 68(1-2): 1-3 (2006) - [c8]Clemens Grabmayer, Jan Willem Klop, Bas Luttik:
Some Remarks on Definability of Process Graphs. CONCUR 2006: 16-36 - [c7]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge. ICALP (2) 2006: 492-503 - [i2]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge. CoRR abs/cs/0608001 (2006) - 2005
- [j7]Elena M. Bortnik, Nikola Trcka, Anton Wijs, Bas Luttik, Joanna M. van de Mortel-Fronczak, Jos C. M. Baeten, Wan J. Fokkink, Jacobus E. Rooda:
Analyzing a chi model of a turntable system using Spin, CADP and Uppaal. J. Log. Algebraic Methods Program. 65(2): 51-104 (2005) - [j6]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge. Log. Methods Comput. Sci. 1(1) (2005) - [j5]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
CCS with Hennessy's merge has no finite-equational axiomatization. Theor. Comput. Sci. 330(3): 377-405 (2005) - [j4]Bas Luttik, Vincent van Oostrom:
Decomposition orders another generalisation of the fundamental theorem of arithmetic. Theor. Comput. Sci. 335(2-3): 147-186 (2005) - [c6]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Finite Equational Bases in Process Algebra: Results and Open Questions. Processes, Terms and Cycles 2005: 338-367 - [c5]Bas Luttik, Nikola Trcka:
Stuttering Congruence for chi. SPIN 2005: 185-199 - [c4]Clemens Grabmayer, Jan Willem Klop, Bas Luttik:
Reflections on a Geometry of Processes. APC 25 2005: 183-190 - [c3]Bas Luttik:
What is algebraic in process theory? APC 25 2005: 227-231 - [i1]Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge. CoRR abs/cs/0501040 (2005) - 2004
- [j3]Bas Luttik, Piet Rodenburg, Rakesh M. Verma:
Remarks on Thatte's transformation of term rewriting systems. Inf. Comput. 195(1-2): 66-87 (2004) - 2003
- [j2]Bas Luttik:
On the expressiveness of choice quantification. Ann. Pure Appl. Log. 121(1): 39-87 (2003) - [c2]Bas Luttik:
A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory. MFCS 2003: 562-571 - 2000
- [c1]Wan J. Fokkink, S. P. Luttik:
An omega-Complete Equational Specification of Interleaving. ICALP 2000: 729-743
1990 – 1999
- 1998
- [j1]Jan Friso Groote, Bas Luttik, Jos van Wamel:
Editorial. Formal Aspects Comput. 10(5-6): 435 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 00:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
