scholarly journals Improving Synchronous Dataflow Analysis Supported by Petri Net Mappings

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 448
Author(s):  
José-Inácio Rocha ◽  
Octávio Páscoa Dias ◽  
Luís Gomes
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Initial Conditions ◽  
Digital Signal ◽  
Industrial Applications ◽  
New Approach ◽  
Synchronous Dataflow ◽  
Model Driven ◽  
Property Verification ◽  
Static Schedule

Whereas most of the work that analyses Synchronous Dataflow (SDF) stays in the dataflow framework, this work pushes its analysis into another framework level, thereby addressing issues that are not well addressed or are even unexplored in SDF. In this manner, the paper proposes a model-driven engineering (MDE) method, combining Synchronous Dataflow (SDF) and Petri nets, to highlight and reinforce their interoperability in digital signal processing applications, cyber-physical systems, or industrial applications. Improvements regarding the settlement and exploitation of the initial conditions associated with SDF are demonstrated; this issue is crucial for every cyber-physical system, since a system’s initial conditions are crucial to ensuring the system’s liveness. The improvements outlined in this work exploit an innovating mapping in the Place/Transition (P/T) Petri net domain that is intended to reduce and predict the total amount of initial data in SDF channels. The relevance of the firing semantics engaged with the equivalent Petri net model is discussed. This paper proposes a new approach to estimate whether an SDF has a static schedule by performing simulation and property verification of the equivalent-based P/T Petri net system achieved, framed by a Petri net invariant analysis and based on the stubborn set method of Petri nets. In this way, this new approach will allow mitigating the state explosion problem. Finally, a strategy is applied to two case studies to discover all the elementary circuits (static schedules) associated with the generated model’s state-space.

Merging and Splitting Petri Net Models within Distributed Embedded Controller Design

2013 ◽  
pp. 160-183 ◽  
Author(s):  
Luis Gomes ◽  
Anikó Costa ◽  
João Paulo Barros ◽  
Filipe Moutinho ◽  
Fernando Pereira
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Code Generation ◽  
Controller Design ◽  
Output Place ◽  
Time Domains ◽  
Splitting Operation ◽  
Embedded Controller ◽  
Automatic Code ◽  
Property Verification

Design of distributed embedded controllers can benefit from the adoption of a model-based development attitude, where Petri nets modeling can provide support for a comprehensive specification and documentation of the system together with verification capabilities and automatic deployment into implementation platforms. This chapter presents a Petri nets-based development flow based on composition and decomposition of Petri net models, using Input-Output Place-Transition Petri nets (IOPT nets) as the underlying formalism, allowing reusability of models in new situations through a net addition operation, as well as partitioning of the model into components using a net splitting operation. Distributed embedded controllers are addressed adding the concept of time domains to IOPT nets. Finally, a tool chain framework is presented supporting the whole development process, from specification to implementation, including property verification, simulation, and automatic code generation for deployment into implementation platforms (considering hardware-based implementation and VHDL coding or software-oriented implementation and C coding).

Vulnerability, Uncertainty and Probability (VUP) Quantification of a Network of Interacting Satellites Using Stochastic Petri Nets (SPN)

2013 ◽  
Author(s):  
Atefeh Einafshar ◽  
Farrokh Sassani
Keyword(s):  
Markov Chain ◽  
Quantitative Analysis ◽  
Petri Nets ◽  
State Space ◽  
Petri Net ◽  
Stochastic Petri Nets ◽  
Discrete State ◽  
New Approach ◽  
Stochastic Petri Net ◽  
Discrete State Space

A new approach to Vulnerability, Uncertainty and Probability (VUP) quantification procedure using Stochastic Petri Nets within a network of interacting satellites is presented. A Stochastic Petri Net based model is developed to quantify VUP in a network of interacting satellites. Three indicators are proposed to determine the VUP definitions in interacting network of satellites. The proposed VUP quantification scheme addresses a methodology which employs a Stochastic Petri Net for quantitative analysis of the behavior of the network. With the random variables associated with the Petri Net transitions, the dynamic behavior of the cooperating satellites in a SPN model can be mapped onto a time-continuous Markov chain with discrete state space. After generating a Markov Stochastic Petri Net model, the probability of a given condition in the network at a specified time can be computed and quantified as well as the vulnerability and uncertainty of the system using the identified indicators.

Modeling With Colored Petri Nets

2021 ◽  
pp. 397-424
Author(s):  
Dmitry A. Zaitsev ◽  
Tatiana R. Shmeleva
Keyword(s):  
Performance Evaluation ◽  
Petri Nets ◽  
Petri Net ◽  
Real Life ◽  
Colored Petri Nets ◽  
Correctness Proof ◽  
Model Driven ◽  
Cpn Tools ◽  
Complex Models ◽  
And Performance

Aviation and aerospace systems are complex and concurrent and require special tools for their specification, verification, and performance evaluation. The tool in demand should be easily integrated into the standard loop of model-driven development. Colored Petri nets represent a combination of a Petri net graph and a functional programming language ML that makes it powerful and convenient tool for specification of real-life system and solving both tasks: correctness proof i.e. verification and performance evaluation. This chapter studies basic and advanced features of CPN Tools – a powerful modeling system which uses graphical language of colored Petri nets. Starting with a concept of colored hierarhical timed Petri net, it goes through declaration of color sets and functions to peculiarities of hierarchical design of complex models and specification of timed characteristics. The authors accomplish the chapter with a real-life case study of performance evaluation for switched Ethernet network.

Modeling With Colored Petri Nets

2019 ◽  
pp. 378-404
Author(s):  
Dmitry A. Zaitsev ◽  
Tatiana R. Shmeleva
Keyword(s):  
Performance Evaluation ◽  
Petri Nets ◽  
Petri Net ◽  
Real Life ◽  
Colored Petri Nets ◽  
Correctness Proof ◽  
Model Driven ◽  
Cpn Tools ◽  
Complex Models ◽  
And Performance

Aviation and aerospace systems are complex and concurrent and require special tools for their specification, verification, and performance evaluation. The tool in demand should be easily integrated into the standard loop of model-driven development. Colored Petri nets represent a combination of a Petri net graph and a functional programming language ML that makes it powerful and convenient tool for specification of real-life system and solving both tasks: correctness proof i.e. verification and performance evaluation. This chapter studies basic and advanced features of CPN Tools – a powerful modeling system which uses graphical language of colored Petri nets. Starting with a concept of colored hierarhical timed Petri net, it goes through declaration of color sets and functions to peculiarities of hierarchical design of complex models and specification of timed characteristics. The authors accomplish the chapter with a real-life case study of performance evaluation for switched Ethernet network.

scholarly journals Unfolding through processes to compute the complete prefix of Petri nets

2017 ◽  
Vol Volume 27 - 2017 - Special... ◽  
Author(s):  
Médésu Sogbohossou ◽  
Antoine Vianou
Keyword(s):  
Petri Nets ◽  
State Space ◽  
Partial Order ◽  
Petri Net ◽  
The State ◽  
Classical Approach ◽  
New Approach ◽  
State Space Explosion ◽  
Single Process ◽  
Partial Order Semantics

The partial-order technique of the unfolding implicitly represents state-space of a Petri net (PN), by in particular preserving the concurrency relations between the events. That makes it possible to contain state-space explosion problem in case of strong concurrency. A complete prefix of unfolding is used to cover all the state-space of a bounded PN: its computation according to the classical approach is based on the concept of adequate order, taking directly into account only safe PN. In this paper, a new approach independent of the concept of adequate order and faithful to the partial-order semantics, consists in creating the events of the unfolding in the context of a single process at the same time. The results of the tests are conclusive for safe and nonsafe PN. Some solutions are presented to improve compactness of the prefix obtained. La technique d'ordre partiel du dépliage représente implicitement l'espace d'état d'un réseau de Petri (RdP), en conservant notamment les relations de concurrence entre les événements. Cela permet de contenir le phénomène de l'explosion combinatoire en cas de forte concurrence. Un préfixe complet de dépliage sert à couvrir tout l'espace d'état d'un RdP borné: son calcul suivant l'approche classique se base sur le concept d'ordre adéquat, ne prenant directement en compte que les RdP saufs. Dans cet article, une nouvelle approche indépendante du concept d'ordre adéquat et fidèle à la sémantique d'ordre partiel, consiste à créer les événements du dépliage dans le contexte d'un unique processus à la fois. Les résultats des tests sont concluants pour les RdP saufs et non saufs. Des solutions sont présentées pour améliorer la compacité du préfixe obtenu.

Petri Net Based Specification in the Design of Logic Controllers with Exception Handling Mechanism

2012 ◽  
Vol 58 (1) ◽  
pp. 43-48 ◽  
Author(s):  
Michał Doligalski ◽  
Marian Adamski
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
State Machine ◽  
Exception Handling ◽  
Levels Of Abstraction ◽  
New Approach ◽  
Common Solution ◽  
Handling Mechanism ◽  
State Machine Diagram ◽  
Logic Controllers

Petri Net Based Specification in the Design of Logic Controllers with Exception Handling Mechanism Hierarchical Petri nets beside UML state machine diagrams, sequentional function charts (SFC) and hierarchical concurrent state machines are common solution for specification of logic controllers. These specification formats provide both concurrency and modeling on multi levels of abstraction (hierarchic approach). But only state machine diagrams supports exceptions handling in direct way. Program model presented in form of state machine diagram may be later transformed into a program in the SFC language or transformed in the Petri Net and implemented in the FPGA structure. Similarity between SFC language and Petri Nets give us lot of tools for analysis such control system. Article presents new approach for exceptions handling in hierarchical Petri nets as formal specification for logic controllers. Proposed method of specification can be used independently or as a part of dual specification (correlated state machine diagram and hierarchical configurable Petri Net).

Constrained Petri Nets. Part II: Generalizations and extensions

1983 ◽  
Vol 6 (3-4) ◽  
pp. 333-374
Author(s):  
H.J.M. Goeman ◽  
L.P.J. Groenewegen ◽  
H.C.M. Kleijn ◽  
G. Rozenberg
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Theoretical Framework ◽  
General Constraints ◽  
Context Free ◽  
Boolean Expressions

This paper continues the investigation froll1 [Goeman et al.] concerning the use of sets of places of a Petri net as additional (to input places) constraints for granting concession. Now interpretations of more general constraints are considered and expressed as Boolean expressions. This gives rise to various classes of constrained Petri nets. These are compared in the language theoretical framework introduced in [Goeman et al.]. An upperbound for the language defining power is found in the class of context-free programmed languages.

An Axiomatic Characterization of a Class of Petri Nets

1991 ◽  
Vol 14 (4) ◽  
pp. 477-491
Author(s):  
Waldemar Korczynski
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Axiomatic Characterization ◽  
Algebraic Characterization

In this paper an algebraic characterization of a class of Petri nets is given. The nets are characterized by a kind of algebras, which can be considered as a generalization of the concept of the case graph of a (marked) Petri net.

Sign in / Sign up

Export Citation Format

Share Document