English
Related papers

Related papers: Bisimulations for Delimited-Control Operators

200 papers

The goal and the main result of the paper is to provide a complete description of the field of rational differential invariants of one class of second order ordinary differential equations with scalar control parameter with respect to Lie…

Analysis of PDEs · Mathematics 2015-06-26 D. S. Gritsenko , O. M. Kiriukhin

There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics. Moreover, there exist a few approaches for automatically deriving axiomatizations…

Logic in Computer Science · Computer Science 2013-07-30 Daniel Gebler , Eugen-Ioan Goriac , Mohammad Reza Mousavi

The operational behavior of control operators has been studied comprehensively in the past few decades, but type systems of control operators have not. There are distinct type systems for shift, control, and shift0 without any relationship…

Programming Languages · Computer Science 2023-05-05 Chiaki Ishio , Kenichi Asai

A mimic computing oriented automaton can directly portray the behaviors of a mimic computing system. In this paper, we investigate the following theoretical problems on this type of automata: operational semantics and computational ability.…

Formal Languages and Automata Theory · Computer Science 2018-01-30 Weijun Zhu

We define two extensions of the typed linear lambda-calculus that yield minimal Turing-complete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both…

Logic in Computer Science · Computer Science 2016-11-28 Sandra Alves , Maribel Fernández , Mário Florido , Ian Mackie

On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic…

Logic in Computer Science · Computer Science 2022-04-11 Rafael Romero , Alejandro Díaz-Caro

To develop a full abstract denotational model of a process language based on prebisimulation preorder, its behavioural semantics has two problems: (1) Two processes related by a standard denotational interpretation afford the same finite…

Logic in Computer Science · Computer Science 2026-05-11 Yong Wang

We prove a boundedness criterion for a class of dyadic multilinear forms acting on two-dimensional functions. Their structure is more general than the one of classical multilinear Calder\'{o}n-Zygmund operators as several functions can now…

Classical Analysis and ODEs · Mathematics 2014-11-10 Vjekoslav Kovač , Christoph Thiele

We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on spectral…

Formal Languages and Automata Theory · Computer Science 2017-05-16 Borja Balle , Pascale Gourdeau , Prakash Panangaden

A quantum deformed theory applicable to all shape-invariant bound-state systems is introduced by defining q-deformed ladder operators. We show these new ladder operators satisfy new q-deformed commutation relations. In this context we…

Mathematical Physics · Physics 2008-11-26 A. N. F. Aleixo , A. B. Balantekin , M. A. Candido Ribeiro

We investigate the interplay between a modality for controlling the behaviour of recursive functional programs on infinite structures which are completely silent in the syntax. The latter means that programs do not contain "marks" showing…

Logic in Computer Science · Computer Science 2023-06-22 Paula Severi

In this paper we show that classical notions from automata theory such as simulation and bisimulation can be lifted to the context of enriched categories. The usual properties of bisimulation are nearly all preserved in this new context.…

Logic in Computer Science · Computer Science 2007-05-23 Vincent Schmitt , Krzysztof Worytkiewicz

A new functional model for pairs of commuting isometries is described. Intertwining operators between such models are then studied in order to approach the classification of invariant subspaces of such pairs.

Spectral Theory · Mathematics 2008-05-27 H. Bercovici , R. G. Douglas , C. Foias

The modelling, specification and study of the semantics of concurrent reactive systems have been interesting research topics for many years now. The aim of this thesis is to exploit the strengths of the (co)algebraic framework in modelling…

Logic in Computer Science · Computer Science 2015-02-11 Georgiana Caltais

The analysis of industrial processes, modelled as descriptor systems, is often computationally hard due to the presence of both algebraic couplings and difference equations of high order. In this paper, we introduce a control refinement…

Systems and Control · Computer Science 2017-04-07 Fei Chen , Sofie Haesaert , Alessandro Abate , Siep Weiland

In this paper, we investigate diagrams, namely functors from any small category to a fixed category, and more particularly, their bisimilarity. Initially defined using the theory of open maps of Joyal et al., we prove several equivalent…

Logic in Computer Science · Computer Science 2020-06-08 Jérémy Dubut

We introduce $(\gamma,\delta)$-similarity, a notion of system comparison that measures to what extent two stable linear dynamical systems behave similarly in an input-output sense. This behavioral similarity is characterized by measuring…

Optimization and Control · Mathematics 2023-12-20 Armin Pirastehzad , Arjan van der Schaft , Bart Besselink

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

Logic · Mathematics 2015-12-16 Pedro Sánchez Terraf

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

Enabling preserving bisimilarity is a refinement of strong bisimilarity, which preserves safety as well as liveness properties. To define it properly, labelled transition systems needed to be upgraded with a successor relation, capturing…

Logic in Computer Science · Computer Science 2023-09-01 Rob van Glabbeek , Peter Höfner , Weiyou Wang
‹ Prev 1 4 5 6 7 8 10 Next ›