English
Related papers

Related papers: Are Two Binary Operators Necessary to Obtain a Fin…

200 papers

This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus on the recursion, relabelling and restriction free fragment of CCS and we discuss…

Logic in Computer Science · Computer Science 2021-05-04 Luca Aceto , Elli Anastasiadi , Valentina Castiglioni , Anna Ingolfsdottir , Bas Luttik

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 proposed by Hennessy in 1981 to the…

Logic in Computer Science · Computer Science 2017-01-11 Luca Aceto , Wan Fokkink , Anna Ingolfsdottir , Bas Luttik

For insight into the parallel composition for true concurrency, we recall the axiomatization of the parallel composition modulo truly concurrent behavioral equivalences as the sidelights of truly concurrent process algebra APTC. We prove…

Logic in Computer Science · Computer Science 2020-10-20 Yong Wang

This paper studies the existence of finite equational axiomatisations of the interleaving parallel composition operator modulo the behavioural equivalences in van Glabbeek's linear time-branching time spectrum. In the setting of the process…

Logic in Computer Science · Computer Science 2023-06-22 Luca Aceto , Valentina Castiglioni , Anna Ingolfsdottir , Bas Luttik , Mathias R. Pedersen

The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we…

Logic in Computer Science · Computer Science 2019-02-20 Jos C. M. Baeten , Bas Luttik , Tim Muller , Paul van Tilburg

In this paper we investigate the equational theory of (the restriction, relabelling, and recursion free fragment of) CCS modulo rooted branching bisimilarity, which is a classic, bisimulation-based notion of equivalence that abstracts from…

Logic in Computer Science · Computer Science 2022-06-29 Luca Aceto , Valentina Castiglioni , Anna Ingolfsdottir , Bas Luttik

CCS can be considered as a most natural extension of finite state automata in which interaction is made possible thanks to parallel composition. We propose here a similar extension for top-down tree automata. We introduce a parallel…

Logic in Computer Science · Computer Science 2013-06-10 Thomas Ehrhard , Ying Jiang

We develop a behavioral theory for the untyped call-by-value lambda calculus extended with the delimited-control operators shift and reset. For this calculus, we discuss the possible observable behaviors and we define an applicative…

Programming Languages · Computer Science 2012-01-05 Dariusz Biernacki , Serguei Lenglet

Extending the notion of parallelism we introduce the concept of approximate parallelism in normed spaces and then substantially restrict ourselves to the setting of Hilbert space operators endowed with the operator norm. We present several…

Functional Analysis · Mathematics 2019-08-15 Mohammad Sal Moslehian , Ali Zamani

We introduce the wire calculus. Its dynamic features are inspired by Milner's CCS: a unary prefix operation, binary choice and a standard recursion construct. Instead of an interleaving parallel composition operator there are operators for…

Logic in Computer Science · Computer Science 2009-12-04 Paweł Sobociński

We present a theory of environmental bisimilarity for the delimited-control operators {\it shift} and {\it reset}. We consider two different notions of contextual equivalence: one that does not require the presence of a top-level control…

Programming Languages · Computer Science 2013-09-17 Dariusz Biernacki , Sergueï Lenglet

The parallel sum for adjoinable operators on Hilbert $C^*$-modules is introduced and studied. Some results known for matrices and bounded linear operators on Hilbert spaces are generalized to the case of adjointable operators on Hilbert…

Operator Algebras · Mathematics 2018-07-16 Wei Luo , Chuanning Song , Qingxiang Xu

Closure spaces are a generalisation of topological spaces obtained by removing the idempotence requirement on the closure operator. We adapt the standard notion of bisimilarity for topological models, namely Topo-bisimilarity, to closure…

Logic in Computer Science · Computer Science 2021-05-17 Vincenzo Ciancia , Diego Latella , Mieke Massink Erik de Vink

Complementable operators extend classical matrix decompositions, such as the Schur complement, to the setting of infinite-dimensional Hilbert spaces, thereby broadening their applicability in various mathematical and physical contexts. This…

Functional Analysis · Mathematics 2025-01-14 Sachin Manjunath Naik , P. Sam Johnson

This paper deals mainly with some aspects of the adjointable operators on Hilbert $C^*$-modules. A new tool called the generalized polar decomposition for each adjointable operator is introduced and clarified. As an application, the general…

Functional Analysis · Mathematics 2024-04-25 Xiaofeng Zhang , Xiaoyi Tian , Qingxiang Xu

This paper investigates composition operators and weighted composition operators on semi-Hilbert spaces induced by positive multiplication operators on \( L^2(\mu) \). Within the framework of \( A \)-adjoint operators, we characterize…

Functional Analysis · Mathematics 2025-08-08 Y. Estaremi , M. S. Al Ghafri

We formulate a minimum requirement for CFT operators to be localized in the dual AdS. In any spacetime dimensions, we show that a general solution to the requirement is a linear superposition of operators creating spherical boundaries in…

High Energy Physics - Theory · Physics 2015-07-16 Yu Nakayama , Hirosi Ooguri

In this paper we study shorted operators relative to two different subspaces, for bounded operators on infinite dimensional Hilbert spaces. We define two notions of complementability in the sense of Ando for operators, and study the…

Functional Analysis · Mathematics 2007-05-23 Jorge Antezana , Gustavo Corach , Demetrio Stojanoff

We give an axiomatisation of strong bisimilarity on a small fragment of CCS that does not feature the sum operator. This axiomatisation is then used to derive congruence of strong bisimilarity in the finite pi-calculus in absence of sum. To…

Logic in Computer Science · Computer Science 2015-07-01 Daniel Hirschkoff , Damien Pous

Necessary and sufficient conditions are already known in the Hardy spaces of both the disc and the half plane for a composition operator to be an isometry, by Nordgren in the disc and by Chalendar and Partington in the half plane. All the…

Functional Analysis · Mathematics 2010-06-11 Sam Elliott
‹ Prev 1 2 3 10 Next ›