AbstractWe model a process—the unit of concurrent processing—as a port automaton, a certain type of nondeterministic sequential machine. We show how to compute the response of these automata, and study the properties of their port interconnections. We are motivated by the work of Milne and Milner, but eschew their use of domains, continuous functions, and power-domains. Instead we can use sets, maps and subsets by applying our theory of greatest fixpoints to the study of the response of nondeterministic machines
AbstractWe survey three applications that use finite automata to specify behaviors of concurrent pro...
We survey various automata models of concurrent systems and their connection with monadic second-ord...
We represent concurrent processes as Boolean propositions or gates, cast in the role of acceptors of...
AbstractWe model a process—the unit of concurrent processing—as a port automaton, a certain type of ...
AbstractWe use input/output automata to define a simple and general model of networks of concurrentl...
AbstractThe purpose of this paper is twofold: to give a precise notion of a realization for simulati...
AbstractConcurrent transition systems (CTS's), are ordinary nondeterministic transition systems that...
Port automata are an operational model for component connectors in a coordination language such as R...
AbstractWe model distributed processes by the computations of synchronized automata. These machines ...
The study of Process Algebra has received a great deal of attention since the pioneering work in the...
AbstractThe paper presents a first step of a coalgebraic analysis of the concept of communicating se...
In this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent automata...
AbstractFrom our previous work on biochemical applications, the structure of port graph (or multigra...
Abstract. We investigate the descriptive succinctness of three fundamental notions for modeling conc...
AbstractIn this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent ...
AbstractWe survey three applications that use finite automata to specify behaviors of concurrent pro...
We survey various automata models of concurrent systems and their connection with monadic second-ord...
We represent concurrent processes as Boolean propositions or gates, cast in the role of acceptors of...
AbstractWe model a process—the unit of concurrent processing—as a port automaton, a certain type of ...
AbstractWe use input/output automata to define a simple and general model of networks of concurrentl...
AbstractThe purpose of this paper is twofold: to give a precise notion of a realization for simulati...
AbstractConcurrent transition systems (CTS's), are ordinary nondeterministic transition systems that...
Port automata are an operational model for component connectors in a coordination language such as R...
AbstractWe model distributed processes by the computations of synchronized automata. These machines ...
The study of Process Algebra has received a great deal of attention since the pioneering work in the...
AbstractThe paper presents a first step of a coalgebraic analysis of the concept of communicating se...
In this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent automata...
AbstractFrom our previous work on biochemical applications, the structure of port graph (or multigra...
Abstract. We investigate the descriptive succinctness of three fundamental notions for modeling conc...
AbstractIn this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent ...
AbstractWe survey three applications that use finite automata to specify behaviors of concurrent pro...
We survey various automata models of concurrent systems and their connection with monadic second-ord...
We represent concurrent processes as Boolean propositions or gates, cast in the role of acceptors of...