Modeling and verification of time dependent systems using time Petri nets

Berthomieu, Bernard; Diaz, Michel

doi:10.1109/32.75415

Cited by 927 publications

(588 citation statements)

References 10 publications

Supporting

Mentioning

567

Contrasting

Unclassified

Order By: Relevance

“…Extensions of the technique, including time, stochastic features, capacities, and hierarchies as well as special Petri net types exist in the literature (see [2,8]...).…”

Section: The Challenge Of Pn Standardisationmentioning

confidence: 99%

See 1 more Smart Citation

PN Standardisation: A Survey

Hillah

Kordon

Petrucci

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Petri Nets formalism requires standardisation to facilitate the work of researchers in this field and to enable the data exchange between different Petri Nets tools through a common format. Following this, a three-part International Standard (ISO/IEC 15909) has been developed. Part 1 is devoted to terms and definitions for Place/Transition Nets and High-Level Petri Nets. It is now completed (published as a standard) but will include an addendum on Symmetric Nets. Part 2 aims at providing a transfer format for High-level Petri Nets, called PNML, based on XML. Work on part 3 which deals with extensions has not started yet. In this paper the first two parts of the standard are presented. Then, to support part 2, an implementation of PNML, through an API framework to be integrated into Petri Net tools, is proposed. It allows for the translation of any Petri Net, designed by a given tool in a dedicated format, into PNML. The Challenge of PN StandardisationPetri Nets [4,8,26,28] are a mathematically defined formalism and may thus be used to provide unambiguous specifications and descriptions of applications. They are especially dedicated to specify and design discrete event systems and this technique is particularly suited to parallel and distributed systems development as it supports concurrency. The technique allows for specification of systems at a level which is independent of the implementation choices (i.e., by software, hardware -electronic and/or mechanical -or humans, or a combination of these) and has been widely used to describe telecommunication systems, protocols, microprocessor architectures,... since their invention in 1962. They also constitute an executable technique, allowing specification prototypes to be developed to test ideas at the earliest and cheapest opportunity. Specifications written in the technique may be subject to analysis methods to prove properties about the specifications, before implementation commences, thus saving on A problem with Petri nets is the explosion of the huge number of elements when described in their graphical form, for specification of complex systems. were developed to overcome this problem by introducing higher-level concepts, such as the use of complex structured data carried by tokens, and using algebraic expressions to annotate net elements. The use of high-level concepts within this Petri net framework is analogous to the use of those in high-level programming languages (as opposed to assembly languages). In the Petri nets community the term High-level net is generally used to refer to nets using such concepts.Two Standardisation of the technique has been seen as an opportunity to obtain a better organisation of the work in the Petri Net community. It has several issues:-to enable the stakeholder -researchers, as well as engineers using Petri nets -to use the same terminology; -to develop future extensions on a stable common basis, e.g., P/T nets or High-level nets; -to provide a reference implementation that will facilitate the data exchange between...

show abstract

“…Extensions of the technique, including time, stochastic features, capacities, and hierarchies as well as special Petri net types exist in the literature (see [2,8]...).…”

Section: The Challenge Of Pn Standardisationmentioning

confidence: 99%

“…So, timed nets can be derived from P/T nets by adding the time information to transitions as in [2]. We can also consider that Symmetric-timed nets inherit from both timed nets and symmetric nets.…”

Section: Fig 1 Example Of Petri Net Types Hierarchymentioning

confidence: 99%

PN Standardisation: A Survey

Hillah

Kordon

Petrucci

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…in each location , Inv( ) is bounded 5 . In this case the number of zones of the simulation graph is finite [14,6].…”

Section: Definition 3 the Simulation Graph Sg(a) Of A Timed Automatonmentioning

confidence: 99%

“…Partial order methods for TPNs are studied in [20], where the authors generalize the concept of stubborn set to time Petri nets, calling it a ready set. They apply it to the state class graph construction of [5]. The efficiency of the method depends on whether the (dynamical) timing coupling between transitions is weak or not.…”

Section: Introductionmentioning

confidence: 99%

Symbolic Unfoldings for Networks of Timed Automata

Cassez

Chatain

Jard

2006

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract. In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets extended with read arcs and symbolic constraints on places and transitions. We prove that there is a complete finite prefix for any NTA that contains at least the information of the simulation graph of the NTA but keep explicit the notions of concurrency and causality of the network.

show abstract

“…To our knowledge, Petri nets were the first theoretical model augmented with time constraints [13,14], and the support of the first reachability algorithms for timed system [15,16].…”

Section: Time Petri Netsmentioning

confidence: 99%

Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets

Sadani

Boyer

Saqui-Sannes

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The paper describes a transformational approach for the specification and formal verification of concurrent and real-time systems. At upper level, one system is specified using the timed process algebra RT-LOTOS. The output of the proposed transformation is a Time Petri net (TPN). The paper particularly shows how a TPN can be automatically constructed from an RT-LOTOS specification using a compositionally defined mapping. The proof of the translation consistency is sketched in the paper and developed in [1].The RT-LOTOS to TPN translation patterns formalized in the paper are being implemented. in a prototype tool. This enables reusing TPNs verification techniques and tools for the profit of RT-LOTOS.

show abstract

Modeling and verification of time dependent systems using time Petri nets

Cited by 927 publications

References 10 publications

PN Standardisation: A Survey

PN Standardisation: A Survey

Symbolic Unfoldings for Networks of Timed Automata

Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets

Contact Info

Product

Resources

About