Branching Bisimilarity with Explicit Divergence (2008)
Van Glabbeek, Rob, Luttik, Bas, Trcka, Nikola
We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching...
Decomposition Orders another generalisation of the fundamental theorem of arithmetic (2008)
Bas Luttik, Vincent Van Oostrom
We discuss unique decomposition in partial commutative monoids. Inspired by a result from process theory, we propose the notion of decomposition order for partial commutative monoids, and prove that...
What is algebraic in process theory? ∗ (2008)
This is an extended version of an essay with the same title that I wrote
Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, Bas Luttik
finite equational base for CCS with left merge
Some Remarks on Definability of Process Graphs (2008)
Clemens Grabmayer, Jan Willem Klop, Bas Luttik, Cwi Amsterdam
Abstract. We propose the notions of “density ” and “connectivity ” of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and BPP. For a process...
Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy’s merge (2008)
Copyright C, Luca Aceto, Luca Aceto, Willem Jan Fokkink, Willem Jan Fokkink, Wan Fokkink, ...
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...
Computation Tree Logic with Deadlock Detection (extended abstract) (2008)
Rob Van Glabbeek, Bas Luttik, Nikola Trčka
Abstract. We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL−X). This relation...
Computation Tree Logic with Deadlock Detection (2008)
Rob Van Glabbeek, Bas Luttik, Nikola Trčka
Abstract. We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL−X). This relation...
Computation Tree Logic with Deadlock Detection (extended abstract) (2008)
Rob Van Glabbeek, Bas Luttik, Nikola Trčka
Abstract. We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL−X). This relation...
Computation Tree Logic with Deadlock Detection (2008)
Rob Van Glabbeek, Bas Luttik, Nikola Trčka
Abstract. We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL−X). This relation...
W. J. Fokkink, S. P. Luttik, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...
We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not !-complete by...
Alternative Quantification Vs. Input Prefixing (2007)
Jan Friso, Jan Friso Groote, Bas Luttik
This is a summary of our paper "Process algebras with alternative quantification over data" (Groote and Luttik (1998)). In this paper, we define a class of process algebras with a...
On the expressiveness of the choice quantifier (2007)
We define process algebras with a generalised operation P for choice. For every infinite cardinal, we prove that the algebra of transition trees with branching degree! is free in the class of process...
A Note on Unique Factorisation of Communicating Processes (2007)
Milner and Moller (1993) have shown that processes that are expressible in a language with action prefix, choice and an operation k for parallel composition by means of pure interleaving have the...
Branching Bisimulation with Explicit Divergence (2007)
Rob Van Glabbeek, Bas Luttik, Nikola Trčka
Abstract. We consider the relational characterisation of branching bisimulation with explicit divergence. We prove that it is an equivalence relation and that it coincides with the original...
A string is any finite sequence of symbols from a given set of symbols (the alphabet). In this course, we have already encountered many types of strings. For example, abstract propositions are...
A Finite Equational Base for CCS with Left Merge and Communication Merge (2006)
Aceto, Luca, Fokkink, Wan, Ingolfsdottir, Anna, Luttik, Bas
Using the left merge and communication merge from ACP, we present an equational base (i.e., a ground-complete and $\omega$-complete set of valid equations) for the fragment of CCS without recursion,...
A finite equational base for CCS with left merge and communication merge (2006)
Anna Ingólfsdóttir, Copyright C, Willem Jan Fokkink, Willem Jan Fokkink, Luca Aceto, Luca Aceto, ...
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge (2005)
Aceto, Luca, Fokkink, Wan, Ingolfsdottir, Anna, Luttik, Bas
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation...
Finite equational bases in process algebra: Results and open questions (2005)
Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, Bas Luttik
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these semantics in the...
Stuttering congruence for χ (2005)
Abstract. The language χ is a modeling and simulation language which is currently mainly used to analyse and optimize the performance of industrial systems. To be able to also verify functional...
CCS with Hennessy’s merge has no finite equational axiomatization (2005)
Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik
This paper confirms a conjecture of Bergstra and Klop’s from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion...
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge (2004)
Copyright C, Willem Jan Fokkink, Willem Jan Fokkink, Luca Aceto, Luca Aceto, Luca Aceto, ...
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation...
A unique decomposition theorem for ordered monoids with applications in process theory (2003)
Abstract. We prove a unique decomposition theorem for a class of ordered commutative monoids. Then, we use our theorem to establish that every weakly normed process definable in ACP ε with bounded...
W. J. Fokkink, S. P. Luttik, Issn -x, Copyright Stichting, Mathematisch Centrum, Wan Fokkink, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
An omega-complete Equational Specification of Interleaving (2000)
We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not !-complete by...
Specification of Rewriting Strategies (1997)
Eelco Visser, Eelco Visser, Bas Luttik, Bas Luttik, Bas Luttik, E. Visser
User-definable strategies for the application of rewrite rules provide a means to construct transformation systems that apply rewrite rules in a controlled way. This paper describes a strategy...
Transformation of Reduction Systems - a view on proving correctness (1996)
Supervisors Prof. Dr, J. A. Bergstra, Dr. P. H. Rodenburg, Bas Luttik, Bas Luttik, Bas Luttik
Reduction Systems : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2.3 Term Rewriting Systems : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.3.1 Terms : : : : : : : : : : :...
Branching-Time and Abstraction (1989)
Rob Van Glabbeek, Bas Luttik, Nikola Trčka
We consider the relational characterisation of branching bisimulation with explicit divergence. We prove that it is an equivalence relation and that it coincides with the original definition of...
Branching-Time and Abstraction (1989)
Rob Van Glabbeek, Bas Luttik, Nikola Trčka
We consider the relational characterisation of branching bisimulation with explicit divergence. We prove that it is an equivalence relation and that it coincides with the original definition of...
Transformations of Reduction Systems
Bas Luttik, Bas Luttik, Bas Luttik, Piet Rodenburg, Piet Rodenburg, Piet Rodenburg
We consider transformations of reduction systems in an abstract setting. We study some sets of correctness criteria for such transformations, adapt a notion of simulation proposed by Kamperman and...