Analysis of place/transition nets with timed arcs and its application to batch process control

Hanisch, Hans-Michael

doi:10.1007/3-540-56863-8_52

Cited by 86 publications

(47 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There are two prominent models that involve timing: timed automata (TA) [1] and different time extensions of Petri nets like Time Petri Nets (TPN) [24] and Timed-Arc Petri Nets (TAPN) [5,16]. Both symbolic 1 and explicit time-representation techniques have been developed for these models.…”

Section: Introductionmentioning

confidence: 99%

Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets

Birch

Jacobsen

Jensen

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. State-space explosion is a major obstacle in verification of time-critical distributed systems. An important factor with a negative influence on the tractability of the analysis is the size of constants that clocks are compared to. This problem is particularly accented in explicit state-space exploration techniques. We suggest an approximation method for reducing the size of constants present in the model. The proposed method is developed for Timed-Arc Petri Nets and creates an under-approximation or an over-approximation of the model behaviour. The verification of approximated Petri net models can be considerably faster but it does not in general guarantee conclusive answers. We implement the algorithms within the open-source model checker TAPAAL and demonstrate on a number of experiments that our approximation techniques often result in a significant speed-up of the verification.

show abstract

Section: Introductionmentioning

confidence: 99%

Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets

Birch

Jacobsen

Jensen

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The components of the BSCU are implemented using Matlab/Simulink and sequence diagram-based test cases and the system architecture of the BSCU are modeled using IBM Rational Rhapsody. These test cases are translated into timed-arc Petri nets (TAPN) [7], which are modeled and analyzed using the tool TAPAAL [4]. For the virtual integration, we developed a prototype which is able to export the necessary information from Rhapsody.…”

Section: Introductionmentioning

confidence: 99%

Sequence Diagram Test Case Specification and Virtual Integration Analysis using Timed-Arc Petri Nets

Sieverding¹,

Ellen²,

Battram³

2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

In this paper, we formally define Test Case Sequence Diagrams (TCSD) as an easy-to-use means to specify test cases for components including timing constraints. These test cases are modeled using the UML2 syntax and can be specified by standard UML-modeling-tools. In a component-based design an early identification of errors can be achieved by a virtual integration of components before the actual system is build. We define such a procedure which integrates the individual test cases of the components according to the interconnections of a given architecture and checks if all specified communication sequences are consistent. Therefore, we formally define the transformation of TCSD into timed-arc Petri nets and a process for the combination of these nets. The applicability of our approach is demonstrated on an avionic use case from the ARP4761 standard.

show abstract

“…In this paper we shall focus on two other, perhaps the most studied, extensions called Time Petri Nets of Merlin and Faber [66,67] introduced in 1976 and the model of Timed-Arc Petri Nets first studied around 1990 by Bolognesi, Lucidi, Trigila and Hanisch [26,50].…”

Section: Onml Hijkmentioning

confidence: 99%

“…The last extension of Petri nets that we consider in this paper is called Timed-Arc Petri Nets (TAPN) [26,50]. Here the time entity (also called age) is associated with tokens.…”

Section: Timed-arc Petri Netsmentioning

confidence: 99%

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

Srba

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded platforms where reliability and safety depend to a large extent on the time features. Many of the time dependant models were suggested as real-time extensions of several well-known untimed models. The most studied formalisms include Networks of Timed Automata which extend the model of communicating finite-state machines with a finite number of real-valued clocks, and timed extensions of Petri nets where the added time constructs include e.g. time intervals that are assigned to the transitions (Time Petri Nets) or to the arcs (Timed-Arc Petri Nets). In this paper, we shall semiformally introduce these models, discuss their strengths and weaknesses, and provide an overview of the known results about the relationships among the models.

show abstract

Analysis of place/transition nets with timed arcs and its application to batch process control

Cited by 86 publications

References 9 publications

Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets

Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets

Sequence Diagram Test Case Specification and Virtual Integration Analysis using Timed-Arc Petri Nets

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

Contact Info

Product

Resources

About