Related papers: Type System for Four Delimited Control Operators
We present a calculus that models a form of process interaction based on copyless message passing, in the style of Singularity OS. The calculus is equipped with a type system ensuring that well-typed processes are free from memory faults,…
This paper presents a general definition of pseudo-differential operators of type $1,1$; the definition is shown to be the largest one that is both compatible with negligible operators and stable under vanishing frequency modulation.…
The Parameterised Model Checking Problem asks whether an implementation Impl(t) satisfies a specification Spec(t) for all instantiations of parameter t. In general, t can determine numerous entities: the number of processes used in a…
In this work, we push further the analysis of the problem of switching controls proposed in [E. Zuazua, Switching control, J. Eur. Math. Soc. (JEMS), 13(1): 85--117, 2011]. The problem consists in the following one: assuming that one can…
Probabilistic operational semantics for a nondeterministic extension of pure lambda calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics are both…
In this paper we consider shift operators, self-adjoint, unitary and normal operators on the standard module over a unital C*-algebra A. We define various generalized spectra in A of these operators, give description of such spectra of…
This paper presents a novel hybrid control protocol for de-conflicting multiple vehicles with constraints on control inputs. We consider turning rate and linear speed constraints to represent fixed-wing or car-like vehicles. A set of…
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. This paper proposes a dependent type theory for multiparty…
The essence of the microgrid cyber-physical system (CPS) lies in the cyclical conversion of information flow and energy flow. Most of the existing coupling models are modeled with static networks and interface structures, in which the…
Modeling the interaction between components is crucial for many applications and serves as a fundamental step in analyzing and verifying properties in multi-agent systems. In this paper, we propose a method based on 1-safe Petri nets to…
We model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of recognizability result for the resulting class of term…
Work is aimed at automating the process of obtaining a list of security threats aimed at the information system in the work processes of data transfer are considered, definitions for each process are presented. The typification of processes…
In 1990, J.L. Krivine introduced the notion of storage operator to simulate, in $\lambda$-calculus, the "call by value" in a context of a "call by name". J.L. Krivine has shown that, using G\"odel translation from classical into…
Type systems certify program properties in a compositional way. From a bigger program one can abstract out a part and certify the properties of the resulting abstract program by just using the type of the part that was abstracted away.…
This paper introduces a simple type system for combinatory logic in which combinators have at most one type, whose polymorphism is revealed by application. The combinatory types exactly describe the structure of their values, which may be…
Distributed formation maneuver control refers to the problem of maneuvering a group of agents to change their formation shape by adjusting the motions of partial agents, where the controller of each agent only requires local information…
Users of shared control systems change their behavior in the presence of assistance, which conflicts with assumpts about user behavior that some assistance methods make. In this paper, we propose an analysis technique to evaluate the user's…
Motivated by distributed implementations of game-theoretical algorithms, we study symmetric process systems and the problem of attaining common knowledge between processes. We formalize our setting by defining a notion of peer-to-peer…
The aim of this work is to define a planner that enables robust legged locomotion for complex multi-agent systems consisting of several holonomically constrained quadrupeds. To this end, we employ a methodology based on behavioral systems…
Many studies have been conducted on statistical convergence, and it remains an area of active research. Since its introduction, statistical convergence has found applications many fields. Nevertheless, there is a shortage of research…