Forward Reachability Analysis of Timed Petri Nets

Abdulla, Parosh Aziz; Deneux, Johann; Mahata, Pritha; Nylén, Aletta

doi:10.1007/978-3-540-30206-3_24

Cited by 17 publications

(22 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [15], the authors propose a methodology to design a symbolic representation of dc-sets. However the design of such a symbolic data-structure is far from being trivial.…”

Section: Lemma 4 (From [19]) Given a Wstsmentioning

confidence: 99%

“…To the best of our knowledge, this is the first time that such a generic representation is proposed. An attempt in that direction was taken in [15] but the result is a theory for designing symbolic representation of downward closed sets 1 A function that returns all the states that have a one-step successor in a given set of states. 2 A set S is upward (resp.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Complete Abstract Interpretation Framework for Coverability Properties of WSTS

Ganty

Raskin

Begin

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present an abstract interpretation based approach to solve the coverability problem of well-structured transition systems. Our approach distinguishes from other attempts in that (1) we solve this problem for the whole class of well-structured transition systems using a forward algorithm. So, our algorithm has to deal with possibly infinite downward closed sets. (2) Whereas other approaches have a non generic representation for downward closed sets of states, which turns out to be hard to devise in practice, we introduce a generic representation requiring no additional effort of implementation.

show abstract

“…In [15], the authors propose a methodology to design a symbolic representation of dc-sets. However the design of such a symbolic data-structure is far from being trivial.…”

Section: Lemma 4 (From [19]) Given a Wstsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Complete Abstract Interpretation Framework for Coverability Properties of WSTS

Ganty

Raskin

Begin

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The model of TAPN was first studied by Bolognesi, Lucidi, Trigila and Hanisch [4,9] and it has proved particularly suitable for modelling of manufacturing systems, workflow management systems and other applications [1,2,14,15,16].…”

Section: Introductionmentioning

confidence: 99%

“…We are not aware of other tools for the analysis of TAPN, except for two tool prototypes implementing a backward coverability algorithm based on the better-quasi-ordering technique [2] and a forward reachability algorithm presented in [1]. Both implementations consider only the basic TAPN model.…”

Section: Introductionmentioning

confidence: 99%

TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets

David

Jacobsen

et al. 2012

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

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 automated verification of the EF, AG, EG and AF fragments of TCTL via translations to Uppaal timed automata and via its own dedicated verification engine. After more than three years of active development with a main focus on usability aspects and on the efficiency of the verification algorithms, we present the new version of TAPAAL 2.0 that has by now reached its maturity and offers the first publicly available tool supporting the analysis and verification of timed-arc Petri nets.

show abstract

“…In dense time nets, time is interpreted as continuous, and the ages of tokens are real numbers. Some problems for dense time nets have been studied in [AN01,AN02,ADMN04].…”

Section: Introductionmentioning

confidence: 99%

Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness

Abdulla¹,

Mahata²,

Mayr³

2007

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions). We consider the following verification problems for TPNs.(i) Zenoness: whether there exists a zeno-computation from a given marking, i.e., an infinite computation which takes only a finite amount of time. We show decidability of zenoness for TPNs, thus solving an open problem from [dFERA00]. Furthermore, the related question if there exist arbitrarily fast computations from a given marking is also decidable.On the other hand, universal zenoness, i.e., the question if all infinite computations from a given marking are zeno, is undecidable.(ii) Token liveness: whether a token is alive in a marking, i.e., whether there is a computation from the marking which eventually consumes the token. We show decidability of the problem by reducing it to the coverability problem, which is decidable for TPNs.(iii) Boundedness: whether the size of the reachable markings is bounded. We consider two versions of the problem; namely semantic boundedness where only live tokens are taken into consideration in the markings, and syntactic boundedness where also dead tokens are considered. We show undecidability of semantic boundedness, while we prove that syntactic boundedness is decidable through an extension of the Karp-Miller algorithm.

show abstract

Forward Reachability Analysis of Timed Petri Nets

Cited by 17 publications

References 12 publications

A Complete Abstract Interpretation Framework for Coverability Properties of WSTS

A Complete Abstract Interpretation Framework for Coverability Properties of WSTS

TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets

Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness

Contact Info

Product

Resources

About