The following pages link to Bas Luttik (Q393089):
Displaying 50 items.
- Reactive Turing machines (Q393091) (← links)
- On the axiomatizability of priority. II (Q549169) (← links)
- Unguardedness mostly means many solutions (Q549175) (← links)
- Unique parallel decomposition in branching and weak bisimulation semantics (Q896916) (← links)
- On finite alphabets and infinite bases (Q924717) (← links)
- The equational theory of prebisimilarity over basic CCS with divergence (Q975471) (← links)
- On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
- Remarks on Thatte's transformation of term rewriting systems (Q1763376) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- Decomposition orders -- another generalisation of the fundamental theorem of arithmetic (Q1781996) (← links)
- On the expressiveness of choice quantification (Q1874242) (← links)
- Off-the-shelf automated analysis of liveness properties for just paths (extended abstract) (Q2117021) (← links)
- Off-the-shelf automated analysis of liveness properties for just paths (Q2182670) (← links)
- On the axiomatisability of priority. III: Priority strikes again (Q2193294) (← links)
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence (Q2272990) (← links)
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal (Q2568979) (← links)
- Proof Graphs for Parameterised Boolean Equation Systems (Q2842127) (← links)
- Turing Meets Milner (Q2914361) (← links)
- Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics (Q2915175) (← links)
- Expressiveness modulo bisimilarity of regular expressions with parallel composition (Q2971071) (← links)
- Reactive Turing Machines (Q3088297) (← links)
- On the Executability of Interactive Computation (Q3188271) (← links)
- Up-to Techniques for Branching Bisimilarity (Q3297777) (← links)
- (Q3396576) (← links)
- Branching Bisimilarity with Explicit Divergence (Q3398965) (← links)
- A Process-Theoretic Look at Automata (Q3400912) (← links)
- Computation Tree Logic with Deadlock Detection (Q3401140) (← links)
- A Finite Equational Base for CCS with Left Merge and Communication Merge (Q3591426) (← links)
- (Q4963995) (← links)
- (Q5014795) (← links)
- (Q5015359) (← links)
- (Q5020941) (← links)
- (Q5020944) (← links)
- (Q5028469) (← links)
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? (Q5056368) (← links)
- (Q5089283) (← links)
- Divide and congruence III: Stability & divergence (Q5111628) (← links)
- (Q5111639) (← links)
- (Q5119395) (← links)
- (Q5155681) (← links)
- (Q5216151) (← links)
- Reflections on a Geometry of Processes (Q5262964) (← links)
- A finite equational base for CCS with left merge and communication merge (Q5277824) (← links)
- Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge (Q5310634) (← links)
- Evidence for Fixpoint Logic (Q5351951) (← links)
- Model Checking Software (Q5394559) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431344) (← links)
- Some Remarks on Definability of Process Graphs (Q5756607) (← links)
- (Q5856418) (← links)
- Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity (Q5875352) (← links)
