In modern society services and support provided by computer-based systems have become
ubiquitous and indeed have started to fund amentally alter the way people conduct their …

This paper discusses issues that arise when process algebras and Petri nets are linked; in
particular, operators, compositional ity, recursion, refinement and equivalences. It uses the …

Petri nets with read arcs are investigated wrt their unfolding, where read arcs model reading
without consuming, which is often more adequate than the destructive-read-and-rewrite …

In contrast to common belief, the Calculus of Communicating Systems (CCS) and similar
process algebras lack the expressive power to accurately capture mutual exclusion …

In the process algebra community it is sometimes suggested that, on some level of
abstraction, any distributed system can be modelled in standard process-algebraic …

Last decade, a number of stochastic enrichments of process algebras was constructed to
facilitate the specification of stochastic processes based on the the well-developed …

In this paper it is shown that a concept of fairness is actually necessary even to solve the
classical mutual exclusion problem. This result justifies a distinction between problems …

The model-checking problem for 1-safe Petri nets and linear-time temporal logic (LTL)
consists of deciding, given a 1-safe Petri net and a formula of LTL, whether the Petri net …

We investigate the synthesis problem for ENCL-systems, defined as Elementary Net
Systems extended with context (inhibitor and activator) arcs and explicit event localities …

A concurrent history represented by a causality structure that captures the intrinsic, invariant
dependencies between its actions, can be interpreted as defining a set of closely related …