TAPAAL 2.0: Integrated development environment for timed-arc Petri nets

A David, L Jacobsen, M Jacobsen… - … 2012, Held as Part of the …, 2012 - Springer
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 …

Start pruning when time gets urgent: Partial order reduction for timed systems

FM Bønneland, PG Jensen, KG Larsen… - … 2018, Held as Part of the …, 2018 - Springer
Partial order reduction for timed systems is a challenging topic due to the dependencies
among events induced by time acting as a global synchronization mechanism. So far, there …

Verification of liveness properties on closed timed-arc Petri nets

M Andersen, H Gatten Larsen, J Srba… - … Engineering Methods in …, 2013 - Springer
Verification of closed timed models by explicit state-space exploration methods is an
alternative to the wide-spread symbolic techniques based on difference bound matrices …

A forward reachability algorithm for bounded timed-arc Petri nets

A David, L Jacobsen, M Jacobsen, J Srba - arxiv preprint arxiv:1211.6194, 2012 - arxiv.org
Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and
several translations to networks of timed automata have been proposed for this model. We …

On effective representations of well quasi-orderings

S Halfon - 2018 - theses.hal.science
With motivations coming from Verification, we define a notionof effective WQO for which it is
possible to represent closed subsetsand to compute basic set-operations on these …

[HTML][HTML] TCTL-preserving translations from timed-arc Petri nets to networks of timed automata

J Byg, M Jacobsen, L Jacobsen, KY Jørgensen… - Theoretical Computer …, 2014 - Elsevier
We present a framework for TCTL-preserving translations between time-dependent
modeling formalisms. The framework guarantees that once the original and the translated …

Coverability analysis of time basic Petri nets with non-urgent behavior

M Camilli, C Bellettini, L Capra… - 2016 18th International …, 2016 - ieeexplore.ieee.org
Time Basic Petri nets are an expressive extension of Petri nets, suitable to model real-time
systems. This paper introduces a coverability analysis technique to cope with structurally …

[PDF][PDF] On E ective Representations of Well asi-Orderings

S Halfon - 2018 - lsv.fr
Well Quasi-Ordering (WQO) is a notion from order theory that lies between wellorders
(ordinals) and well-founded quasi-orderings: a well-order is WQO, and a WQO is well …

Constructing Coverability Graphs for Time Basic Petri Nets

M Camilli - arxiv preprint arxiv:1409.6253, 2014 - arxiv.org
Time-Basic Petri nets, is a powerful formalism for modeling real-time systems where time
constraints are expressed through time functions of marking's time description associated …

[PDF][PDF] A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets

ADLJM Jacobsen, J Srba - homes.cs.aau.dk
Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and
several translations to networks of timed automata have been proposed for this model. We …