Verification of computing grids with special edge conditions by infinite Petri nets
Reads0
Chats0
TLDR
A technique of the computing grids verification using invariants of infinite Petri nets was presented, finding that liveness investigation based on siphons and traps can be implemented using p-invariants of modified nets.Abstract:
A technique of the computing grids verification using invariants of infinite Petri nets was presented. Models of square grid structures in the form of parametric Petri nets for such edge conditions as connection of edges and truncated devices were constructed. Infinite systems of linear algebraic equations were composed on parametric Petri nets for calculating p-invariants; their parametric solutions were obtained. P-invariant Petri nets are structurally conservative and bounded that together with liveness are the properties of ideal systems. Liveness investigation based on siphons and traps can be implemented using p-invariants of modified nets.read more
Citations
More filters
Journal ArticleDOI
Homomorphic Encryption of Supervisory Control Systems Using Automata
TL;DR: This paper considers the encryption of supervisors of discrete event systems modeled with deterministic finite-state automata and proposes an encryption framework of supervisory control systems based on the matrix notation of automata, using matrix notation to make it suitable for homomorphic encryption schemes over integers.
Journal ArticleDOI
GAPN-LA: A framework for solving graph problems using Petri nets and learning automata
TL;DR: Several graph-based problems have been solved in this paper using the proposed GAPN-LA, an adaptive Petri net, organized into a graph structure, which can be considered as a framework for solving graph- based problems.
Journal ArticleDOI
Infinite Petri Nets: Part 1, Modeling Square Grid Structures
TL;DR: Parametric description of Petri nets, parametric representation of infinite systems for the calculation of place/transition invariants, and solving them in parametric form allowed the invariance proof for infinite Petri net models to be proved.
Journal ArticleDOI
Verification of hypertorus communication grids by infinite petri nets and process algebra
TL;DR: It is proven that the basic solutions of the infinite system have been found and that the infinite Petri net is bounded and conservative and some remarks regarding liveness and liveness enforcing techniques are presented.
Journal ArticleDOI
Fault-Recovery and Repair Modeling of Discrete Event Systems using Petri Nets
TL;DR: This work develops a methodology for investigating the behavior of faults on the resources in discrete event systems that are failure-prone and proposes a method to make the system able to continue performing its duties, while the failed resources are under a repair and recovery process.
References
More filters
Journal ArticleDOI
Petri nets: Properties, analysis and applications
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Journal ArticleDOI
The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
TL;DR: In addition to the graphic-editing facilities, the software tool Tina proposes the construction of a number of representations for the behaviour of Petrinets or Time Petri nets, which provide a finite symbolic representation of their behaviour in terms of state classes.
Journal ArticleDOI
Petri Nets Theory for the Correctness of Protocols
Gérard Berthelot,Richard Terrat +1 more
TL;DR: In this paper, a model of the connection and disconnection phases is developed, and properties of correctness are demonstrated, using Petri net theory results, namely, reductions and linear invariants techniques.
Book ChapterDOI
On the computation of structural synchronic invariants in P/T nets
Manuel Silva,José Manuel Colom +1 more
TL;DR: A full algebraic characterization of structural synchronic relations is obtained and it is said to be a general approach in the sense that instead of single transitions, subsets of transitions are directly taken into account.
Related Papers (5)
Verification of hypercube communication structures via parametric Petri nets1
Two theoretical and practical aspects of knitting technique: invariants and a new class of Petri net
D.Y. Chao,D.T. Wang +1 more