Analyse von Petri-Netz-Modellen

Starke, Peter

doi:10.1007/978-3-663-09262-9

Cited by 123 publications

(32 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The second one should be in the modeled workpiece properties, because their recurring appearance should be reflected in their modeling in the plant model. These two, and possible other cycles in the TIG, are determined by applying again the approach from [11] (mentioned in Section IV). But at this time, I is constructed based on the TIG.…”

Section: Structural Analysismentioning

confidence: 99%

“…Thus, the signal components are not considered in I. I is equivalent to the incidence matrix of the composed S N CES model. For solving the equation system an approach proposed from Starke [11] is utilized. There, I is extended with the identity matrix and the lines of this extended matrix are charged against each other resulting in a matrix representing all t-invariants and their corresponding transitions.…”

Section: Structural Analysismentioning

confidence: 99%

See 1 more Smart Citation

A new model structure based synthesis approach for distributed discrete process control

Winkler

Lapp

Hanisch

2011

2011 9th IEEE International Conference on Industrial Informatics

View full text Add to dashboard Cite

This contribution introduces a new approach for synthesizing discrete process control. In this context, the main focus of this contribution is on a methodology to enhance the synthesis process by application of new structural analysis methods for the used formal modeling language safe Net Condition/Event Systems. These analysis methods are derived from Petri net analysis methods and adapted to the used modeling language. Furthermore, a new kind of model structure based graphical meta description of the model behavior will be introduced. This graphical representation allows system behavior analysis without exploring the whole state space and improves the application of the supposed synthesis method.

show abstract

Section: Structural Analysismentioning

confidence: 99%

Section: Structural Analysismentioning

confidence: 99%

A new model structure based synthesis approach for distributed discrete process control

Winkler

Lapp

Hanisch

2011

2011 9th IEEE International Conference on Industrial Informatics

View full text Add to dashboard Cite

show abstract

“…This problem is adapted from Hruz and Zhou (2008) [4], whom adapted this problem further from Starke (1990) [10]. Obviously, communication channel is a bottle neck here, as there are three CPUs and each may compete for a channel when only two are available.…”

Section: Case Study: a Resource Sharing Problemmentioning

confidence: 99%

Representing resources in petri net models: Hardwiring or soft-coding?

Davidrajuh

2011

Proceedings of 2011 IEEE International Conference on Service Operations, Logistics and Informatics

View full text Add to dashboard Cite

This paper presents an interesting design problem in developing a new tool for discrete-event dynamic systems (DEDS). A new tool known as GPenSIM was developed for modeling and simulation of DEDS; GPenSIM is based on Petri Nets. The design issue this paper talks about is whether to represent resources in DEDS hardwired as a part of the Petri net structure (which is the widespread practice) or to soft code as common variables in the program code. This paper shows that soft coding resources give benefits such as simpler and skinny models. _________________________________________________________________________________________________________________________

show abstract

“…The set of allowed firing times is given by an interval of nonnegative real numbers, the interval having rational bounds, but, following the discussion in [39], without loss of generality only integer firing times will be considered here. A firing event t : (where t 2 T and is a binding for t) of a d-Mnet N is enabled iff it is so in the underlying M-net, i.e.…”

Section: Hierarchical Duration M-netsmentioning

confidence: 99%

Compositional high level Petri nets with timing constraints - a comparison

Pelz

Fleischhack²

Third International Conference on Application of Concurrency to System Design, 2003. Proceedings.

View full text Add to dashboard Cite

The paper aims at comparing various timed extensions of a fully compositional class of high-level Petri nets, called M-nets. On one hand, as a classical approach, a class of timed M-nets is considered, where intervals of duration are attached to each transition. More precisely, we study this class enriched by the recently introduced hierarchical operation of timed refinement. On the other hand, M-nets enriched by the causal time concept [23, 34] are considered, they are called causal time M-nets and allow to introduce timing constraints without extending the original untimed model of M-nets. Causal time M-nets are shown to form the more powerful class. It covers timed and even hierarchical timed M-nets. Moreover, as shown by some significant examples, it permits the modelling of systems involving overlapping timing constraints. Some special cases are quoted where hierarchical timed M-nets may become favorite.

show abstract

Analyse von Petri-Netz-Modellen

Cited by 123 publications

References 0 publications

A new model structure based synthesis approach for distributed discrete process control

A new model structure based synthesis approach for distributed discrete process control

Representing resources in petri net models: Hardwiring or soft-coding?

Compositional high level Petri nets with timing constraints - a comparison

Contact Info

Product

Resources

About