- Remarks on Thatte's Transformation of Term Rewriting Bas Luttik 1;2; Piet Rodenburg 2 Rakesh Verma 3;y
- Branching Bisimilarity with Explicit Divergence Rob van Glabbeek
- An #Complete Equational Specification of Interleaving #
- The Equational Theory of Prebisimilarity over Basic CCS with Divergence #
- On Finite Alphabets and Infinite Bases Taolue Chen a,1 Wan Fokkink a,b,# Bas Luttik a,c Sumit Nain d
- T## C########## C##### BRICS, Department of Computer Science
- Choice Quantification in Process Algebra
- Specification of Rewriting Strategies \Lambda Sebastiaan P. Luttik 1;3;+ Eelco Visser 2;3;#
- Finite Equational Bases in Process Algebra: Results and Open Questions
- Submitted to: EXPRESS 2010
- Finite Equational Bases for Fragments of CCS with Restriction and Relabelling #
- On the Expressiveness of Choice Quanti cation
- Logical Methods in Computer Science Vol. 5 (4:5) 2009, pp. 1--24
- CCS with Hennessy's Merge has no Finite Equational Axiomatization
- A ProcessTheoretic Look at Automata J.C.M. Baeten, P.J.L. Cuijpers, B. Luttik, and P.J.A. van Tilburg
- Submitted to: EXPRESS 2010
- Decomposition Orders another generalisation of the fundamental
- Logical Methods in Computer Science Vol. 1 (1:3) 2005, pp. 1--12
- Finite Equational Bases in Process Algebra: Results and Open Questions
- Remarks on Thatte's Transformation of Term Rewriting Bas Luttik1,2,
- Choice Quantification in Process Algebra
- Branching Bisimilarity with Explicit Divergence Rob van Glabbeek
- A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory
- Alternative quantification vs. input prefixing Jan Friso Groote 1;2 Bas Luttik 1;3; \Lambday
- Computations and Interaction Jos C.M. Baeten1,2
- Stuttering Congruence for Bas Luttik1,2
- What is Algebraic in Process Theory? Formal Methods Group
- Transformation of Reduction Systems a view on proving correctness
- Logical Methods in Computer Science Vol. 1 (1:3) 2005, pp. 112
- Decomposition Orders another generalisation of the fundamental
- Innovations Syst Softw Eng manuscript No. (will be inserted by the editor)
- Unguardedness Mostly Means Many Solutions Jos C. M. Baetena,b
- Logical Methods in Computer Science Vol. 5 (4:5) 2009, pp. 124
- The Equational Theory of Prebisimilarity over Basic CCS with Divergence
- Submitted to: EXPRESS 2010
- A Process-Theoretic Look at Automata J.C.M. Baeten, P.J.L. Cuijpers, B. Luttik, and P.J.A. van Tilburg
- Finite Equational Bases for Fragments of CCS with Restriction and Relabelling
- A Finite Equational Base for CCS with Left Merge and Communication Merge
- An -Complete Equational Specification of Interleaving
- What is algebraic in process theory? Bas Luttik1
- On the Axiomatizability of Priority II Luca Acetoa,1
- S. Froschle, F.D. Valencia (Eds.): Workshop on Expressiveness in Concurrency 2010 (EXPRESS'10).
- Reactive Turing Machines Jos C. M. Baeten, Bas Luttik, and Paul van Tilburg
- Automated Verification of Executable UML Models
