Parallelism and concurrency are fundamental concepts in computer science. Specification
and verification of concurrent programs are of first importance. It concerns our daily life …

The work in this thesis has been carried out at the Centrum Wiskunde & Informatica, under
the auspices of the research school IPA (Institute for Programming research and …

The propositional temporal logic of linear time (PTL) is interpreted over linear orders of order
type (/spl omega/,/spl les/). In applications, these linear orders consist of interleaved …

The main results of the present paper are the equivalence of definability by monadic second-
order logic and recognizability for real trace languages, and that first-order definable, star …

We show that a set of uniformly width-bounded infinite series-parallel pomsets is ω-series-
rational iff it is axiomatizable in monadic second order logic iff it is ω-recognizable. This …

The main results of the present paper are the equivalence of monadic second order logic
and recognizability for real trace languages, and that first order definable, star-free, and …

We continue our study of negotiations, a concurrency model with multi-party negotiation as
primitive. In a previous paper [7] we have provided a correct and complete set of reduction …

Automata with concurrency relations, which occurred in formal verification methods of
concurrent programs, are labeled transition systems with a collection of binary relations …

For infinite words there are well-known characterizations of safety and liveness properties.
We extend these results to real Mazurkiewicz traces. This is possible due to a result, which …

This dissertation investigates and extends the mathematical foundations of logics and
automata for the interleaving and synchronous noninterleaving view of system computations …