Bibliographies thématiques / Preemptive Time Petri Nets / Articles de revues

Articles de revues sur le sujet « Preemptive Time Petri Nets »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Preemptive Time Petri Nets.
Auteur : Grafiati
Publié le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Preemptive Time Petri Nets ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Heidari, Parisa, et Hanifa Boucheneb. « Controller Synthesis of Time Petri Nets Using Stopwatch ». Journal of Engineering 2013 (2013) : 1–13. http://dx.doi.org/10.1155/2013/970487.

Texte intégral
Résumé :
Scheduling is often a difficult task specially in complex systems. Few tools are targeted at both modeling and scheduling of the systems. In controller synthesis, a scheduler is seen as a controller to manage shared resources and timing requirements of a system. This paper proposes a time Petri net-based approach for controller synthesis and finding a scheduler using stopwatch. The solution suggested here is particularly interesting for preemptive scheduling purposes. This paper deals with time Petri nets with controllable and uncontrollable transitions and assumes that a controllable transition can be suspended and retrieved when necessary. In fact, the paper supposes that every controllable transition can be associated with stopwatch. With this hypothesis, the objective is to model a system by time Petri nets and calculate subintervals where the system violates the given property. Then, the controller associates the corresponding controllable transitions with stopwatch to suspend them in their bad subintervals. The interesting advantage of this solution is that this approach synthesizes an ordinary time Petri net model before adding stopwatch. Therefore, complicated computations and overapproximations required during controller synthesis of time Petri nets associated with stopwatch are avoided.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Adjir, Noureddine, Pierre de Saqui-Sannes et Kamel Mustapha Rahmouni. « Conformance Testing of Preemptive Real-Time Systems ». International Journal of Embedded and Real-Time Communication Systems 4, no 4 (octobre 2013) : 1–26. http://dx.doi.org/10.4018/ijertcs.2013100101.

Texte intégral
Résumé :
The paper presents an approach for model-based black-box conformance testing of preemptive real-time systems using Labeled Prioritized Time Petri Nets with Stopwatches (LPrSwTPN). These models not only specify system/environment interactions and time constraints. They further enable modelling of suspend/resume operations in real-time systems. The test specification used to generate test primitives, to check the correctness of system responses and to draw test verdicts is an LPrSwTPN made up of two concurrent sub-nets that respectively specify the system under test and its environment. The algorithms used in the TINA model analyzer have been extended to support concurrent composed subnets. Relativized stopwatch timed input/output conformance serves as the notion of implementation correctness, essentially timed trace inclusion taking environment assumptions into account. Assuming the modelled systems are non deterministic and partially observable, the paper proposes a test generation and execution algorithm which is based on symbolic techniques and implements an online testing policy and outputs test results for the (part of the) selected environment.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Bicchierai, Irene, Giacomo Bucci, Laura Carnevali et Enrico Vicario. « Combining UML-MARTE and Preemptive Time Petri Nets : An Industrial Case Study ». IEEE Transactions on Industrial Informatics 9, no 4 (novembre 2013) : 1806–18. http://dx.doi.org/10.1109/tii.2012.2205399.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Bucci, G., L. Sassoli et E. Vicario. « Correctness verification and performance analysis of real-time systems using stochastic preemptive time Petri nets ». IEEE Transactions on Software Engineering 31, no 11 (novembre 2005) : 913–27. http://dx.doi.org/10.1109/tse.2005.122.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Carnevali, Laura, Lorenzo Ridi et Enrico Vicario. « Putting Preemptive Time Petri Nets to Work in a V-Model SW Life Cycle ». IEEE Transactions on Software Engineering 37, no 6 (novembre 2011) : 826–44. http://dx.doi.org/10.1109/tse.2011.4.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Maeda, Yoshiki, et Toshimitu Ushio. « SMT Formulae of Preemptive Controlled Timed Petri Nets and its Application to Distributed Mediators ». Transactions of the Institute of Systems, Control and Information Engineers 29, no 11 (2016) : 518–24. http://dx.doi.org/10.5687/iscie.29.518.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Mu, Haibo, Linzhong Liu et Xiaojing Li. « Signal Preemption Control of Emergency Vehicles Based on Timed Colored Petri Nets ». Discrete Dynamics in Nature and Society 2018 (1 août 2018) : 1–12. http://dx.doi.org/10.1155/2018/7095485.

Texte intégral
Résumé :
This paper focuses on the use of timed colored Petri nets (TCPN) to study emergency vehicle (EV) preemption control problem. TCPN is adopted to establish an urban traffic network model composed of three submodels, namely, traffic flow model, traffic signal display and phase switch model, and traffic signal switch control model. An EV preemption optimization control system, consisting of monitoring subsystem, phase time determination subsystem, and phase switching control subsystem, is designed. The calculation method of the travelling speed of EV on road sections is presented, and the methods of determining the actual green time of current phase and the other phase are given. Some computational comparisons are performed to verify the signal preemption control strategies, and simulation results indicate that the proposed approach can provide efficient and safe running environments for emergency vehicles and minimize EV’s interference to social vehicles simultaneously.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Huang, Yi Sheng, et Yi Shun Weng. « Based on Synchronized Timed Petri Nets for Emergency Vehicle Preemption Systems ». Advanced Materials Research 291-294 (juillet 2011) : 2775–78. http://dx.doi.org/10.4028/www.scientific.net/amr.291-294.2775.

Texte intégral
Résumé :
Timed Petri net (TPN) has been utilized as a visual formalism for the modeling of complex discrete event dynamic systems. It illuminates the features on describing properties of causality and concurrency. Moreover, it is well-known that synchronized timed Petri net (STPN) allows us to present all of the concurrent states in complex TPN. In this paper, we propose a new methodology to design, analyze and implement an urban emergency vehicle preemption control system by using STPN. The applications of STPN to two-phase traffic lights and emergency vehicle preemption are illustrated. The advantage of the proposed approach is the clear presentation of traffic lights’ behaviors in terms of conditions and events that cause the preemption phases alternations. Finally, a two-phase traffic lights control system with emergency vehicle preemption will be realized by using STPN. To our knowledge, this is the first work that employs STPN to model a two-phase traffic lights control system with emergency vehicle preemption system.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Wegener, Jan-Thierry, et Louchka Popova-Zeugmann. « Petri Nets with Time Windows : A Comparison to Classical Petri Nets ». Fundamenta Informaticae 93, no 1-3 (2009) : 337–52. http://dx.doi.org/10.3233/fi-2009-0106.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Molloy, M. K. « Discrete Time Stochastic Petri Nets ». IEEE Transactions on Software Engineering SE-11, no 4 (avril 1985) : 417–23. http://dx.doi.org/10.1109/tse.1985.232230.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
11

Freedman, P. « Time, Petri nets, and robotics ». IEEE Transactions on Robotics and Automation 7, no 4 (1991) : 417–33. http://dx.doi.org/10.1109/70.86074.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
12

Lime, Didier, Claude Martinez et Olivier H. Roux. « Shrinking of Time Petri nets ». Discrete Event Dynamic Systems 23, no 4 (1 mars 2013) : 419–38. http://dx.doi.org/10.1007/s10626-013-0159-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
13

Salum, Latif. « Petri nets and time modelling ». International Journal of Advanced Manufacturing Technology 38, no 3-4 (16 juin 2007) : 377–82. http://dx.doi.org/10.1007/s00170-007-1098-5.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
14

Huang, Yi-Sheng, Jang-Yi Shiue et Jiliang Luo. « A Traffic Signal Control Policy for Emergency Vehicles Preemption Using Timed Petri Nets ». IFAC-PapersOnLine 48, no 3 (2015) : 2183–88. http://dx.doi.org/10.1016/j.ifacol.2015.06.412.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
15

Peter Bachmann, Jörg, et Louchka Popova-Zeugmann. « Time-independent Liveness in Time Petri Nets ». Fundamenta Informaticae 102, no 1 (2010) : 1–17. http://dx.doi.org/10.3233/fi-2010-293.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
16

Jong-kun, Lee. « Time Composition Problem in Time Petri Nets ». IFAC Proceedings Volumes 30, no 6 (mai 1997) : 1499–504. http://dx.doi.org/10.1016/s1474-6670(17)43573-7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
17

Belala, N., D. E. Saїdouni, R. Boukharrou, A. C. Chaouche, A. Seraoui et A. Chachoua. « Time Petri Nets with Action Duration ». International Journal of Embedded and Real-Time Communication Systems 4, no 2 (avril 2013) : 62–83. http://dx.doi.org/10.4018/jertcs.2013040104.

Texte intégral
Résumé :
The design of real-time systems needs a high-level specification model supporting at the same time timing constraints and actions duration. The authors introduce in this paper an extension of Petri Nets called Time Petri Nets with Action Duration (DTPN) where time is associated with transitions. In DTPN, the firing of transitions is bound to a time interval and transitions represent actions which have explicit durations. The authors give an operational semantics for DTPN in terms of Durational Action Timed Automata (DATA). DTPN considers both timing constraints and durations under a true-concurrency semantics with an aim of better expressing concurrent and parallel behaviours of real-time systems.
Styles APA, Harvard, Vancouver, ISO, etc.
18

Popova-Zeugmann, Louchka, et Dirk Schlatter. « Analyzing Paths in Time Petri Nets ». Fundamenta Informaticae 37, no 3 (1999) : 311–27. http://dx.doi.org/10.3233/fi-1999-37307.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
19

Abdulla, Parosh Aziz, et Richard Mayr. « Petri Nets with Time and Cost ». Electronic Proceedings in Theoretical Computer Science 107 (10 février 2013) : 9–24. http://dx.doi.org/10.4204/eptcs.107.3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
20

Boucheneb, Hanifa, et Kamel Barkaoui. « Stubborn Sets for Time Petri Nets ». ACM Transactions on Embedded Computing Systems 14, no 1 (21 janvier 2015) : 1–25. http://dx.doi.org/10.1145/2680541.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
21

Bozhenkova, E. N., et I. B. Virbitskaite. « Testing Equivalences of Time Petri Nets ». Programming and Computer Software 46, no 4 (juillet 2020) : 251–60. http://dx.doi.org/10.1134/s0361768820040040.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
22

Schastai, Valter, Evangivaldo A. Lima et Luis Allan Künzle. « Sequence analysis for time petri nets ». IFAC Proceedings Volumes 37, no 18 (septembre 2004) : 435–40. http://dx.doi.org/10.1016/s1474-6670(17)30785-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
23

Lee, Jonathan, Jiann-I. Pan et Jong-Yih Kuo. « Verifying scenarios with time Petri-nets ». Information and Software Technology 43, no 13 (novembre 2001) : 769–81. http://dx.doi.org/10.1016/s0950-5849(01)00184-7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
24

Sloan, Robert H., et Ugo Buy. « Reduction rules for time Petri nets ». Acta Informatica 33, no 5 (août 1996) : 687–706. http://dx.doi.org/10.1007/bf03036471.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
25

Sloan, Robert H., et Ugo Buy. « Reduction rules for time Petri nets ». Acta Informatica 33, no 7 (1 octobre 1996) : 687–706. http://dx.doi.org/10.1007/s002360050066.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
26

Sacha, K. « Real-time specification using Petri nets ». Microprocessing and Microprogramming 38, no 1-5 (septembre 1993) : 607–14. http://dx.doi.org/10.1016/0165-6074(93)90201-u.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
27

Huang, Yi-Sheng, Yi-Shun Weng et MengChu Zhou. « Design of Traffic Safety Control Systems for Emergency Vehicle Preemption Using Timed Petri Nets ». IEEE Transactions on Intelligent Transportation Systems 16, no 4 (août 2015) : 2113–20. http://dx.doi.org/10.1109/tits.2015.2395419.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
28

Aman, Bogdan, Péter Battyányi, Gabriel Ciobanu et György Vaszil. « Local time membrane systems and time Petri nets ». Theoretical Computer Science 805 (janvier 2020) : 175–92. http://dx.doi.org/10.1016/j.tcs.2018.06.013.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
29

Berthomieu *, B., P. O. Ribet et F. Vernadat. « The tool TINA – Construction of abstract state spaces for petri nets and time petri nets ». International Journal of Production Research 42, no 14 (15 juillet 2004) : 2741–56. http://dx.doi.org/10.1080/00207540412331312688.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
30

Fűr, Attila. « Extended knowledge attributed Petri Nets ». International Journal of Modeling, Simulation, and Scientific Computing 05, no 02 (25 février 2014) : 1350028. http://dx.doi.org/10.1142/s1793962313500281.

Texte intégral
Résumé :
Choosing the best way for describing physical reality has always been standing in focus of research. Several methodologies have been developed based on classical mathematics, or statistics and also new disciplines — such as soft-computing techniques — appeared. Petri Nets as one of the most naturalistic modeling methodologies are well suited to describe complex process in general. However in some fields of modeling the describing power of basic Petri Nets proved not to be robust enough, therefore several extensions were made to the original concept. Colored tokens (Colored Petri Nets), stochastic delayed streaming of mobile entities (Stochastic Petri Nets), object oriented architecture (Object Oriented Petri Nets), numerical (Numerical Petri Nets) and linguistic attributes (Fuzzy Petri Nets) broaden the range of capabilities. In some fields of problem solving, usage of static and mobile knowledge bases is needed: e.g., flexible manufacturing systems, or intelligent traffic simulation. These problems to be investigated involved new conceptual developments of Petri Nets and led to the introduction of Knowledge Attributed Petri Nets. At the same time distributed control in simulation appeared, intelligent agents supported the connection of mobile knowledge bases and static inference engines in an effective way. The mentioned extensions brought general support in model synthesis, but some unsolved questions remained related to the implementation of intelligent mobile entities. This paper highlights a new level of AI controlled simulation introducing the Extended Knowledge Attributed Petri Nets that offer the capability of easy implementation of mobile inference engines and knowledge base, providing general mobile AI in Petri Nets.
Styles APA, Harvard, Vancouver, ISO, etc.
31

Boucheneb, Hanifa, Adrien Bullich et Olivier H. Roux. « FIFO Time Petri Nets for conflicts handling ». IFAC Proceedings Volumes 45, no 29 (2012) : 143–48. http://dx.doi.org/10.3182/20121003-3-mx-4033.00025.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
32

Boucheneb, Hanifa, Kamel Barkaoui, Qian Xing, KuangZe Wang, GaiYun Liu et ZhiWu Li. « Time based deadlock prevention for Petri nets ». Automatica 137 (mars 2022) : 110119. http://dx.doi.org/10.1016/j.automatica.2021.110119.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
33

Lime, Didier, Olivier H. Roux et Charlotte Seidner. « Cost Problems for Parametric Time Petri Nets* ». Fundamenta Informaticae 183, no 1-2 (10 janvier 2022) : 97–123. http://dx.doi.org/10.3233/fi-2021-2083.

Texte intégral
Résumé :
We investigate the problem of parameter synthesis for time Petri nets with a cost variable that evolves both continuously with time, and discretely when firing transitions. More precisely, parameters are rational symbolic constants used for time constraints on the firing of transitions and we want to synthesise all their values such that some marking is reachable, with a cost that is either minimal or simply less than a given bound. We first prove that the mere existence of values for the parameters such that the latter property holds is undecidable. We nonetheless provide symbolic semi-algorithms for the two synthesis problems and we prove them both sound and complete when they terminate. We also show how to modify them for the case when parameter values are integers. Finally, we prove that these modified versions terminate if parameters are bounded. While this is to be expected since there are now only a finite number of possible parameter values, our algorithms are symbolic and thus avoid an explicit enumeration of all those values. Furthermore, the results are symbolic constraints representing finite unions of convex polyhedra that are easily amenable to further analysis through linear programming. We finally report on the implementation of the approach in Romeo, a software tool for the analysis of time Petri nets.
Styles APA, Harvard, Vancouver, ISO, etc.
34

Virbitskaite, Irina, Dmitry Bushin et Eike Best. « True Concurrent Equivalences in Time Petri Nets* ». Fundamenta Informaticae 149, no 4 (24 décembre 2016) : 401–18. http://dx.doi.org/10.3233/fi-2016-1454.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
35

Srinivasan, V. S., et M. A. Jafari. « Fault detection/monitoring using time Petri nets ». IEEE Transactions on Systems, Man, and Cybernetics 23, no 4 (1993) : 1155–62. http://dx.doi.org/10.1109/21.247896.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
36

Bushin, D. I., et I. B. Virbitskaite. « Comparative trace semantics of time Petri nets ». Programming and Computer Software 41, no 3 (mai 2015) : 131–39. http://dx.doi.org/10.1134/s0361768815030020.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
37

Hadjidj, Rachid, et Hanifa Boucheneb. « Efficient Reachability Analysis for Time Petri Nets ». IEEE Transactions on Computers 60, no 8 (août 2011) : 1085–99. http://dx.doi.org/10.1109/tc.2010.195.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
38

van der Aalst, W. M. P., K. M. van Hee et H. A. Reijers. « Analysis of discrete-time stochastic petri nets ». Statistica Neerlandica 54, no 2 (juillet 2000) : 237–55. http://dx.doi.org/10.1111/1467-9574.00139.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
39

Aura, Tuomas, et Johan Lilius. « A causal semantics for time Petri nets ». Theoretical Computer Science 243, no 1-2 (juillet 2000) : 409–47. http://dx.doi.org/10.1016/s0304-3975(99)00114-0.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
40

Bérard, B., F. Cassez, S. Haddad, D. Lime et O. H. Roux. « The expressive power of time Petri nets ». Theoretical Computer Science 474 (février 2013) : 1–20. http://dx.doi.org/10.1016/j.tcs.2012.12.005.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
41

Boucheneb, Hanifa, et Kamel Barkaoui. « Covering Steps Graphs of Time Petri Nets ». Electronic Notes in Theoretical Computer Science 239 (juillet 2009) : 155–65. http://dx.doi.org/10.1016/j.entcs.2009.05.037.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
42

Boucheneb, H., G. Gardey et O. H. Roux. « TCTL Model Checking of Time Petri Nets ». Journal of Logic and Computation 19, no 6 (6 juillet 2009) : 1509–40. http://dx.doi.org/10.1093/logcom/exp036.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
43

Boucheneb, Hanifa, et Rachid Hadjidj. « CTL* model checking for time Petri nets ». Theoretical Computer Science 353, no 1-3 (mars 2006) : 208–27. http://dx.doi.org/10.1016/j.tcs.2005.11.002.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
44

Peres, Florent, Bernard Berthomieu et François Vernadat. « On the composition of time Petri nets ». Discrete Event Dynamic Systems 21, no 3 (28 avril 2011) : 395–424. http://dx.doi.org/10.1007/s10626-011-0102-2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
45

Basile, Francesco, Maria Paola Cabasino et Carla Seatzu. « K-diagnosability of Time labeled Petri nets ». IFAC Proceedings Volumes 47, no 2 (2014) : 135–41. http://dx.doi.org/10.3182/20140514-3-fr-4046.00055.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
46

Wang, J., Y. Deng et M. Zhou. « Compositional time Petri nets and reduction rules ». IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) 30, no 4 (2000) : 562–72. http://dx.doi.org/10.1109/3477.865173.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
47

Valette, Robert, et Brigitte Pradin‐Chézalviel. « Time Petri nets for modelling civil litigation ». Information & ; Communications Technology Law 7, no 3 (octobre 1998) : 269–80. http://dx.doi.org/10.1080/13600834.1998.9965794.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
48

Li, Xuandong. « Verifying time Petri nets by linear programming ». Journal of Computer Science and Technology 16, no 1 (janvier 2001) : 39–46. http://dx.doi.org/10.1007/bf02948851.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
49

Battyányi, Péter, et György Vaszil. « Description of membrane systems with time Petri nets : promoters/inhibitors, membrane dissolution, and priorities ». Journal of Membrane Computing 2, no 4 (27 octobre 2020) : 341–54. http://dx.doi.org/10.1007/s41965-020-00062-y.

Texte intégral
Résumé :
AbstractWe continue the investigations of the connection between membrane systems and time Petri nets by extending the examined class of systems from simple symbol-object membrane systems to more complex cases: rules with promoters/inhibitors, membrane dissolution, and priority relation on the rules. By constructing the simulating time Petri net, we retain one of the main characteristics of the Petri net model; namely, the firings of the transitions can take place in any order, and there is no need to introduce maximal parallelism in the Petri net semantics. Instead, we substantially exploit the gain in computational strength obtained by the introduction of the timing feature for Petri nets.
Styles APA, Harvard, Vancouver, ISO, etc.
50

PERKUSICH, ANGELO, MARIA L. B. PERKUSICH et SHI-KUO CHANG. « OBJECT ORIENTED DESIGN, MODULAR ANALYSIS, AND FAULT-TOLERANCE OF REAL-TIME CONTROL SOFTWARE SYSTEMS ». International Journal of Software Engineering and Knowledge Engineering 06, no 03 (septembre 1996) : 447–76. http://dx.doi.org/10.1142/s0218194096000193.

Texte intégral
Résumé :
When specifying, designing and analyzing complex real-time systems, it is necessary to adopt a modular or compositional methodology. This methodology shall allow the designer the ability to verify local properties of individual modules or components in the system, and also shall allow the verification of the correct behavior of interacting components. The application of Petri nets for the modeling and verification of systems, at specification and design levels are well known. Despite the powerful structuring mechanisms available in the Petri nets theory for the construction of the model of complex systems, the designer is still likely to face the problem of state explosion, when analyzing and verifying large systems. In this work we introduce a modular analysis methodology for a kind of high level Petri nets named G-Nets.
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Preemptive Time Petri Nets » pour d’autres types de sources :
Thèses Livres
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie