Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Bas Luttik
S. P. Luttik
2010 – today
- 2013
[c15]Sjoerd Cranen, Bas Luttik, Tim A. C. Willemse: Proof Graphs for Parameterised Boolean Equation Systems. CONCUR 2013: 470-484- [i6]Johannes Borgström, Bas Luttik: Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics. CoRR abs/1307.6903 (2013)
- 2012
- [j20]Jos C. M. Baeten, Bas Luttik, Paul van Tilburg: When Turing Meets Milner. ERCIM News 2012(91) (2012)
- [c14]
- [c13]Bas Luttik: Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics. IFIP TCS 2012: 250-264
- [e2]Bas Luttik, Michel A. Reniers (Eds.): Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics. EPTCS 89, 2012
- [i5]Bas Luttik: Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics. CoRR abs/1205.2117 (2012)
- 2011
- [j19]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)
- [j18]Jos C. M. Baeten, Bas Luttik: Unguardedness mostly means many solutions. Theor. Comput. Sci. 412(28): 3090-3100 (2011)
- [c12]
- [c11]
- [e1]Bas Luttik, Frank Valencia (Eds.): Proceedings 18th International Workshop on Expressiveness in Concurrency. EPTCS 64, 2011
- [i4]
- 2010
- [j17]Helle Hvid Hansen, Jeroen Ketema, Bas Luttik, Mohammad Reza Mousavi, Jaco van de Pol: Towards model checking executable UML specifications in mCRL2. ISSE 6(1-2): 83-90 (2010)
- [c10]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
- [c9]Jos C. M. Baeten, Bas Luttik, Tim Muller, Paul van Tilburg: Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract). EXPRESS'10 2010: 1-15
2000 – 2009
- 2009
- [j16]Rob J. van Glabbeek, Bas Luttik, Nikola Trcka: Computation Tree Logic with Deadlock Detection. Logical Methods in Computer Science 5(4) (2009)
- [j15]Rob J. van Glabbeek, Bas Luttik, Nikola Trcka: Branching Bisimilarity with Explicit Divergence. Fundam. Inform. 93(4): 371-392 (2009)
- [j14]Luca Aceto, Wan 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) (2009)
- [c8]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
- [j13]Taolue Chen, Wan Fokkink, Bas Luttik, Sumit Nain: On finite alphabets and infinite bases. Inf. Comput. 206(5): 492-519 (2008)
- [j12]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)
- [c7]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
- [j11]
- [j10]Clemens Grabmayer, Jan Willem Klop, Bas Luttik: Reflections on a Geometry of Processes. Electr. Notes Theor. Comput. Sci. 162: 183-190 (2006)
- [j9]Bas Luttik: What is algebraic in process theory? Electr. Notes Theor. Comput. Sci. 162: 227-231 (2006)
- [j8]Jos C. M. Baeten, S. P. Luttik: Guest editors' introduction: Special issue on Process Theory for Hybrid Systems. J. Log. Algebr. Program. 68(1-2): 1-3 (2006)
- [c6]Clemens Grabmayer, Jan Willem Klop, Bas Luttik: Some Remarks on Definability of Process Graphs. CONCUR 2006: 16-36
- [c5]Luca Aceto, Wan 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 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, J. M. van de Mortel-Fronczak, Jos C. M. Baeten, Wan Fokkink, J. E. Rooda: Analyzing a chi model of a turntable system using Spin, CADP and Uppaal. J. Log. Algebr. Program. 65(2): 51-104 (2005)
- [j6]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik: Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge. Logical Methods in Computer Science 1(1) (2005)
- [j5]Luca Aceto, Wan 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)
- [c4]Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik: Finite Equational Bases in Process Algebra: Results and Open Questions. Processes, Terms and Cycles 2005: 338-367
- [c3]
- [i1]Luca Aceto, Wan 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. Logic 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 Fokkink, S. P. Luttik: An omega-Complete Equational Specification of Interleaving. ICALP 2000: 729-743
1990 – 1999
- 1998
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:23 CEST by the dblp team