Temporal logic model checking is a useful method for verifying properties of finite-state
concurrent systems. However, due to the state explosion problem modular methods like …

We compare propositional temporal logics by comparing the equivalences that they induce
on models. Linear time, branching time and partial order temporal logics are considered …

We introduce an operational model of concurrent systems, called automata with concurrency
relations. These are labeled transition systems in which the event set is endowed with a …

We define families of posets, ordered by prefixes, as the counterpart of the usual families of
configurations ordered by subsets. On these objects we define two types of morphism: event …

The states of a computing system bear information and change time, while its events bear
time and change information. We develop a primitive algebraic model of this duality of time …

Data ow networks are a paradigm for concurrent computation in which a collection of
concurrently and asynchronously executing processes communicate by sending data values …

Abstract Structural Operational Specifications (SOS) are supplied with concurrent models
based on permutations of proved transitions. Those models take the form of trace automata …