Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
Jos C. M. Baeten, Pieter J. L. Cuijpers, Bas Lutti...
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and pro...
The theory of regions and the algorithms for synthesizing a Petri net model from a transition system, which are based on this theory, have interesting practical applications
In this paper, we discuss a formalism for modeling regions that are exposed to movement or deformation. The basis of our formalism is the RCC theory, which uses topological relati...
We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the int...