The recent foundation of a 'Young Children's Perspectives' special interest group in the
European Early Childhood Education Research Association (EECERA) reflects a general …

We study an operator for refinement of actions to be used in the design of concurrent
systems. Actions on a given level of abstraction are replaced by more complicated …

Reversible computation has a growing number of promising application areas such as the
modelling of biochemical systems, program debugging and testing, and even programming …

Abstract Model checking is a powerful and widespread technique for the verification of finite
distributed systems. However, the main hindrance for wider application of this technique is …

<Emphasis Type="Italic">B(PN)</Emphasis><Superscript>2</Superscript> &#x2014; a basic Petr
Page 1 B(PN) 2- a Basic Petri Net Programming Notation Eike Best Institut fiir Informatik …

In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and
uniform way across a wide range of different models for concurrency. In this paper, following …

We propose a notion of alternating bisimulation for strategic abilities under imperfect
information. The bisimulation preserves formulas of ATL∗ for both the objective and …

Model checking for Linear Time Logic (LTL) is usually based on converting the (negation of
a) property into a Buchi automaton, composing the automaton and the model, and finally …

Reversible computation has a growing number of promising application areas such as the
modelling of biochemical systems, program debugging and testing, and even programming …

The realm of approaches to operational descriptions and equivalences for concurrent
systems in the literature lead to a series of different attempts to give a uniform …