Abstract TAPAAL 2.0 is a platform-independent modelling, simulation and verification tool for
extended timed-arc Petri nets. The tool supports component-based modelling and offers an …

We present a general theory for the use of negative premises in the rules of Transition
System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in …

Timed-arc Petri nets (TAPN's) are not Turing powerful, because, in particular, they cannot
simulate a counter with zero testing. Thus, we could think that this model does not increase …

This paper introduces a model for specifying synchronization constraints in distributed
asynchronous multimedia systems and applications. The consistency and semantics of …

Timed-arc Petri nets are not Turing powerful, because, in particular, they cannot simulate a
counter with test on zero. Thus, we could think that this model does not extend significantly …

Abstract Timed-Arc Petri Nets (TAPN) are an extension of the classical P/T nets with
continuous time. Tokens in TAPN carry an age and arcs between places and transitions are …

A LOTOS-like timed process algebra is first introduced, which offers operators for specifying
the urgency of a specified action, but also of an interaction involving two or more processes …

TAPAAL is a new platform independent tool for modelling, simulation and verification of
timed-arc Petri nets. TAPAAL provides a stand-alone editor and simulator, while the …

We show how to reliably compute fast-growing functions with timed-arc Petri nets and data
nets. This construction provides ordinal-recursive lower bounds on the complexity of the …

Performance analysis and formal correctness verification of computer communication
protocols and distributed systems have traditionally been considered as two separate fields …