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

We tackle a natural problem from distributed computing, involving time-stamps. Let?={p 1, p
2,…, p N} be a set of computing agents or processes which synchronize with each other from …

We propose a local, past-oriented fragment of propositional dynamic logic to reason about
concurrent scenarios modelled as Mazurkiewicz traces, and prove it to be expressively …

Das Verhalten nebenläufiger Systeme, zusammen mit der Problematik des Entwurfs, der
Analyse und der Verifikation verteilter Algorithmen, stellt eine Grundherausforderung an die …

Asynchronous automata are parallel compositions of finite-state processes synchronizing
over shared variables. A deep theorem due to Zielonka says that every regular trace …

Abstract Neutron-rich nuclei 1 4 7, 1 4 9, 1 5 1 Ce have been studied via the prompt γ-ray
spectroscopy of 248 Cm fission fragments. A partial level scheme for 151 Ce is presented for …

Traditional automata theory is an extremely useful abstraction for reasoning about
sequential computing devices. For distributed systems, however, there is no clear …

We propose a local, past-oriented fragment of propositional dynamic logic to reason about
concurrent scenarios modelled as Mazurkiewicz traces, and prove it to be expressively …

We present a subset automaton construction for asynchronous cellular automata. This
provides an answer to the problem of direct determinization for asynchronous cellular …

Asynchronous automata are parallel compositions of finite-state processes synchronizing
over shared variables. A deep theorem due to Zielonka says that every regular trace …