In this paper we consider the model of Time Petri Nets (TPN) where time is associated with
transitions. We also consider Timed Automata (TA) as defined by Alur & Dill, and compare …

Inthe? eldofformalmethodsincomputerscience, concurrencytheoryisreceivinga
constantlyincreasinginterest. Thisisespeciallytrueforprocessalgebra. Althoughit had been …

A reversible computing system features backward computations along which the effects of
forward ones are undone when needed. This is accomplished by reverting executed actions …

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 …

Reversible debuggers help programmers to find the causes of misbehaviours in concurrent
programs more quickly, by executing a program backwards from the point where a …

We shortly discuss how Petri nets have been extended with timing constraints and then
choose to associate clocks to tokens and time intervals to arcs from places to transitions. In …

We define a new notation called netcharts for describing sets of message sequence chart
scenarios (MSCs). Netcharts correspond to a distributed version of High-level Message …

Several deterministically/stochastically timed process calculi have been proposed in the
literature that, apart from their synchronization mechanism, mainly differ for the way in which …

The authors use PAFAS (Process Algebra for Faster Asynchronous Systems) to compare the
worst-case efficiency of three bounded-buffer implementations: Fifo, Pipe and Buff. Fifo …