Related papers: On Direct Product and Quotient of Strongly Connect…
Over the past decades, coordination languages have emerged for the specification and implementation of interaction protocols for communicating software components. This class of languages includes Reo, a platform for compositional…
In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…
We show there exists an exact and continuous gauge transformation between the Hamilton-Jacobi equation of classical mechanics, and the time-dependent Schrodinger equation of quantum mechanics. The transformation parameter is spin-dependent,…
This paper contains results related to synthesis and presentation of abstract automata by fragments of behaviour and investigates the structure of the classes of finite connected initial output-less automata specified by systems of defining…
This paper formulates and studies the concepts of approximate (alternating) bisimulation relations characterizing equivalence relations between interconnected systems and their abstractions. These equivalence relations guarantee that the…
We present a new and powerful class of automata which are explicitly concurrent and allow a very simple definition of composition. The novelty of these automata is their time-synchronous message-asynchronous communication mechanism. Time…
This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with $\epsilon$-transitions. It gives an algorithm for testing the exponential ambiguity of an automaton $A$ in time…
The paper is concerned with defining the electrical signals and their models. The delays are discussed, the asynchronous automata - which are the models of the asynchronous circuits - and the examples of the clock generator and of the R-S…
For a $p$-permutation equivalence between two block algebras of finite groups, we introduce new square diagrams that link the $p$-permutation equivalence via the Brauer construction to local equivalences between stabilizers of corresponding…
We study the separability problem for automatic relations (i.e., relations on finite words definable by synchronous automata) in terms of recognizable relations (i.e., finite unions of products of regular languages). This problem takes as…
We prove a functorial correspondence between a category of logarithmic $\mathfrak{sl}_2$-connections on a curve $X$ with fixed generic residues and a category of abelian logarithmic connections on an appropriate spectral double cover $\pi :…
Consider a commutative monoid $(M,+,0)$ and a biadditive binary operation $\mu \colon M \times M \to M$. We will show that under some additional general assumptions, the operation $\mu$ is automatically both associative and commutative. The…
In this paper we study the strict refinement property for connected partial ordersalso known as Hashimoto's Theorem. This property implies that any isomorphismbetween products of irreducible structures is determined is uniquely determinedas…
We present an abstraction and refinement methodology for the automated controller synthesis to enforce general predefined specifications. The designed controllers require quantized (or symbolic) state information only and can be interfaced…
Consider $ A^* $, the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the symbols of the other. The commutative closure of a set $ L…
I describe how the states of a discrete automata with p sites, each of which may be off or on, can be represented as Majorana spinors associated to a spacetime with signature (p,p). Some ideas about the quantization of such systems are…
We consider the setting of component-based design for real-time systems with critical timing constraints. Based on our earlier work, we propose a compositional specification theory for timed automata with I/O distinction, which supports…
In this note, we present some results on the classification of quantum cellular automata (QCA) in 1D under strong equivalence rather than stable equivalence. Under strong equivalence, we only allow adding ancillas carrying the original…
The strong subadditivity inequality of von Neumann entropy relates the entropy of subsystems of a tripartite state $\rho_{ABC}$ to that of the composite system. Here, we define $\boldsymbol{T}^{(a)}(\rho_{ABC})$ as the extent to which…
We study the vacuum pair production by a time-dependent strong electric field based on the exact WKB analysis. We identify the generic structure of a Stokes graph for systems with the vacuum pair production and show that the number of…