A connection between concurrency and language theory

We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and simulation equivalence classes of (regular) synchronization trees (or processes). The results reveal a close relationship between classical language theory and process algebra

A certain synchronizing property of subshifts and flow equivalence

We will study a certain synchronizing property of subshifts called $\lambda$-synchronization. The $\lambda$-synchronizing subshifts form a large class of irreducible subshifts containing irreducible sofic shifts. We prove that the $\lambda$-synchronization is invariant under flow equivalence of subshifts. The $\lambda$-synchronizing K-groups and the $\lambda$-synchronizing Bowen-Franks groups are studied and proved to be invariant under flow equivalence of $\lambda$-synchronizing subshifts. They are new flow equivalence invariants for $\lambda$-synchronizing subshifts.Comment: 28 page

Mapping Fusion and Synchronized Hyperedge Replacement into Logic Programming

In this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationships between a process calculus, the Fusion Calculus, graph transformations in the Synchronized Hyperedge Replacement with Hoare synchronization (HSHR) approach and logic programming. We present a translation from Fusion Calculus into HSHR (whereas Fusion Calculus uses Milner synchronization) and prove a correspondence between the reduction semantics of Fusion Calculus and HSHR transitions. We also present a mapping from HSHR into a transactional version of logic programming and prove that there is a full correspondence between the two formalisms. The resulting mapping from Fusion Calculus to logic programming is interesting since it shows the tight analogies between the two formalisms, in particular for handling name generation and mobility. The intermediate step in terms of HSHR is convenient since graph transformations allow for multiple, remote synchronizations, as required by Fusion Calculus semantics.Comment: 44 pages, 8 figures, to appear in a special issue of Theory and Practice of Logic Programming, minor revisio

Process Algebras

Process Algebras are mathematically rigorous languages with well defined semantics that permit describing and verifying properties of concurrent communicating systems. They can be seen as models of processes, regarded as agents that act and interact continuously with other similar agents and with their common environment. The agents may be real-world objects (even people), or they may be artifacts, embodied perhaps in computer hardware or software systems. Many different approaches (operational, denotational, algebraic) are taken for describing the meaning of processes. However, the operational approach is the reference one. By relying on the so called Structural Operational Semantics (SOS), labelled transition systems are built and composed by using the different operators of the many different process algebras. Behavioral equivalences are used to abstract from unwanted details and identify those systems that react similarly to external experiments

Non-transitive maps in phase synchronization

Concepts from the Ergodic Theory are used to describe the existence of non-transitive maps in attractors of phase synchronous chaotic systems. It is shown that for a class of phase-coherent systems, e.g. the sinusoidally forced Chua's circuit and two coupled R{\"o}ssler oscillators, phase synchronization implies that such maps exist. These ideas are also extended to other coupled chaotic systems. In addition, a phase for a chaotic attractor is defined from the tangent vector of the flow. Finally, it is discussed how these maps can be used to real time detection of phase synchronization in experimental systems