Filters








8,288 Hits in 3.8 sec

Schedulability Analysis of Petri Nets Based on Structural Properties

Cong Liu, A. Kondratyev, Y. Watanabe, A. Sangiovanni-Vincentelli, J. Desel
Sixth International Conference on Application of Concurrency to System Design (ACSD'06)  
This paper suggests a novel approach for schedulability analysis based solely on PN structure.  ...  Schedulability analysis for a given PN answers the question whether a schedule exists in the reachability space of this net.  ...  A PN N is said to be schedulable, if there exist a marking M of N and a schedule of (N, M ). Figure 2 . 2 (a) A non-live, bounded, schedulable Petri net.  ... 
doi:10.1109/acsd.2006.22 dblp:conf/acsd/LiuKWSD06 fatcat:grvp2dwe75f4rb3qcyzljbiep4

A structural approach to quasi-static schedulability analysis of communicating concurrent programs

Cong Liu, Alex Kondratyev, Yosinori Watanabe, Alberto Sangiovanni-Vincentelli
2005 Proceedings of the 5th ACM international conference on Embedded software - EMSOFT '05  
We introduce a Petri net structural property and prove unschedulability if the property holds. We propose a linear programming based algorithm to check the property, and prove the algorithm is valid.  ...  In this paper, we show the underlying mechanism which causes unschedulability in terms of the structure of a Petri net.  ...  STRUCTURAL SCHEDULABILITY ANALYSIS In this section, we develop the theoretic foundations of our approach. Our definition of schedule is based on Petri nets.  ... 
doi:10.1145/1086228.1086231 dblp:conf/emsoft/LiuKWS05 fatcat:6rl4slmgjbbmlhpif27bnmfpxu

A TAOPN Approach to Modeling and Scheduling Cyber-Physical Systems

Zhilin Qian, Huiqun Yu
2013 2013 International Conference on Information Science and Applications (ICISA)  
This approach extends Petri net with time constraints based on aspect-oriented method.  ...  A general scheduling analysis method is presented. This method decomposes the model into four types of modules and analyzes their schedulability separately.  ...  Most current scheduling analysis based on Petri net are focus on Time Petri net by applying the reachability analysis method.  ... 
doi:10.1109/icisa.2013.6579475 dblp:conf/icisa/QianY13 fatcat:k3rt77ru3fasbeo7374evcm6ym

Strategies to Improve Synchronous Dataflows Analysis Using Mappings between Petri Nets and Dataflows [chapter]

José-Inácio Rocha, Octávio Páscoa Dias, Luís Gomes
2014 IFIP Advances in Information and Communication Technology  
The scope of our work will be on consistent dataflow properties that can be easily demystified and efficiently determined with the outlined mapping approach between Dataflows and Petri nets.  ...  The methodology discussed in this paper improves the outcomes produced so far (in Petri net domain) at design stage aiming at knowing the amount of storage resource required, as well as has a substantial  ...  de Setúbal (IPS) in the framework of projects of "3º Concurso de Projectos do IPS", reference 3CP-IPS- .  ... 
doi:10.1007/978-3-642-54734-8_27 fatcat:yef6rkht3ralbe2to4qbvwexye

Romeo: A Tool for Analyzing Time Petri Nets [chapter]

Guillaume Gardey, Didier Lime, Morgan Magnin, Olivier (H. ) Roux
2005 Lecture Notes in Computer Science  
In this paper, we present the features of Romeo, a Time Petri Net (TPN) analyzer. The tool Romeo allows state space computation of TPN and on-the-fly model-checking of reachability properties.  ...  Besides, our tool also deals with an extension of Time Petri Nets (Scheduling-TPNs) for which the valuations of transitions may be stopped and resumed, thus allowing the modeling preemption.  ...  Roux and Déplanche [1] propose an extension for Time Petri Nets (Scheduling-TPNs) that consists of mapping into the Petri net model the way the different schedulers of the system activate or suspend  ... 
doi:10.1007/11513988_41 fatcat:352rrddxsvcgrg6km6nxubdwiy

Time Petri Nets Analysis with TINA

Bernard Berthomieu, François Vernadat
2006 Third International Conference on the Quantitative Evaluation of Systems - (QEST'06)  
Beside the usual graphic editing and simulation facilities, the software tool Tina may build a number of state space abstractions for Petri nets or Time Petri nets, preserving certain classes of properties  ...  For Petri nets, these abstractions help preventing combinatorial explosion and rely on so-called partial order techniques such as covering steps and/or persistent sets.  ...  A major extension of Tina is being experimented that will support such features, based on the "Stopwatch Time Petri Nets" described in [12] .  ... 
doi:10.1109/qest.2006.56 dblp:conf/qest/BerthomieuV06 fatcat:exonlwr2i5eobc5tjdg36s3fsm

Improving Synchronous Dataflow Analysis Supported by Petri Net Mappings

José-Inácio Rocha, Octávio Páscoa Dias, Luís Gomes
2018 Electronics  
Petri net invariant analysis and based on the stubborn set method of Petri nets.  ...  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  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/electronics7120448 fatcat:bpkawbpzprgrzbv2lmswyom4hu

Integrated Analysis of Temporal Behavior of Component-Based Distributed Real-Time Embedded Systems

Pranav Srinivas Kumar, Gabor Karsai
2015 2015 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops  
In earlier work, we have shown a Colored Petri Net-based (CPN) approach to modeling and analyzing component-based DRE systems.  ...  In this paper, we present new CPN-based modeling approaches and advanced state space methods that improve on the scalability and efficiency of the analysis.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not reflect the views of DARPA or NSF.  ... 
doi:10.1109/isorcw.2015.56 dblp:conf/isorc/KumarK15 fatcat:py6k7nq27vbdrix3bnbxxclyn4

Modeling the Scheduling Problem of Identical Parallel Machines with Load Balancing by Time Petri Nets

Sekhri Larbi, Slimane Mohamed
2014 International Journal of Intelligent Systems and Applications  
In this paper we present a Time Petri Net (TPN) based approach to solve the scheduling problem by mapping each entity (tasks, resources and constraints) to correspondent one in the TPN.  ...  In this case, the scheduling problem can be reduced to finding an optimal sequence of transitions leading from an initial marking to a final one.  ...  ACKNOWLEDGMENT This work was supported in part by the Industrial Computing and Networking Laboratory of Oran University.  ... 
doi:10.5815/ijisa.2015.01.04 fatcat:w4gml6ykmrddxb77akayoy3jxy

The tool TINA – Construction of abstract state spaces for petri nets and time petri nets

B. Berthomieu *, P.-O. Ribet, F. Vernadat
2004 International Journal of Production Research  
Introduction Tina (TIme Petri Net Analyser) 1 is a software environment for the editing and analysis of Petri net and Time Petri net (Merlin and Farber 1976) .  ...  These classes of properties may be general properties (reachability properties, deadlock freeness, liveness), specific properties relying on the linear structure of the concrete space state (linear time  ...  Introduction Tina (TIme Petri Net Analyser) 1 is a software environment for the editing and analysis of Petri net and Time Petri net (Merlin and Farber 1976) .  ... 
doi:10.1080/00207540412331312688 fatcat:ur4qrvbwvzevnc7othhwilj7f4

Modeling and scheduling of ratio-driven FMS using unfolding time Petri nets

Jongkun Lee, Ouajdi Korbaa
2004 Computers & industrial engineering  
In this paper, we focus on the analysis of a cyclic schedule for the determination of the optimal cycle time and minimization of the Work in Process (WIP for short).  ...  Especially, this paper deals with product ratio-driven FMS cyclic scheduling problem with each other products and ratios using Timed Petri nets unfolding (TPN for short).  ...  An 'unfolding' is obtained by unfolding a PN, which has the reachability information and properties of an original net. Structural analysis on 'unfolding' is much easier than on the original net.  ... 
doi:10.1016/j.cie.2004.05.015 fatcat:2nzrb7rlnzd7rfo3olpenjntee

Petri net based scheduling

W. M. P. van der Aalst
1996 OR spectrum  
This is illustrated by a Petri net based analysis of the notorious 10 × 10 problem due to Fisher & Thompson (1963) .  ...  To support the modelling of scheduling problems, we provide a method to map tasks, resources and constraints onto a timed Petri net.  ...  Structural properties Several analysis methods have been developed to find and verify structural properties of classical Petri nets (Martinez & Silva, 1982; Murata, 1989; Reisig, 1985) .  ... 
doi:10.1007/bf01540160 fatcat:adhdub4mzbaalhpqqslbqqgnie

Behavioral Modeling of Enterprise Cloud Bus System: High Level Petri Net based Approach

Gitosree Khan, Anirban Sarkar, Sabnam Sengupta
2017 International Journal of Software Engineering and Its Applications  
Moreover, few of the researchers work on the modeling and analysis of Inter-cloud architecture [22] , [23] using Petri-Net based approach.  ...  Therefore, High level Petri Net based approach [25] is most suitable towards analysis of dynamics of such system.  ...  Future work includes the quality analysis of ECBS dynamics from the proposed concepts of HECBP.  ... 
doi:10.14257/ijseia.2017.11.7.02 fatcat:3xokfphzlzdqzoubgprxmmtyry

Colored Petri Net-based Modeling and Formal Analysis of Component-based Applications

Pranav Srinivas Kumar, Abhishek Dubey, Gabor Karsai
2014 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems  
Our approach is based on (1) formalizing the component operation scheduling using Colored Petri nets (CPN), (2) modeling the abstract temporal behavior of application components, and (3) integrating the  ...  This paper describes how we can model and analyze applications for these systems in order to verify system properties such as lack of deadline violations.  ...  Any opinions, ndings, and conclusions or rec-ommendations expressed in this material are those of the authors and do not reect the views of DARPA or NSF.  ... 
dblp:conf/models/KumarDK14 fatcat:and6goqr7bfprffq6jac7hblsi

Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches [chapter]

Didier Lime, Olivier H. Roux, Charlotte Seidner, Louis-Marie Traonouez
2009 Lecture Notes in Computer Science  
Indeed, Romeo now features an efficient model-checking of time Petri nets using the Uppaal DBM Library, the model-checking of stopwatch Petri nets and parametric stopwatch Petri nets using the Parma Polyhedra  ...  Last time we reported on Romeo, analyses with this tool were mostly based on translations to other tools.  ...  Romeo is one of the three main tools on time and stopwatch Petri nets. It performs state-space computation and simulation based on both the state-class method and the zone-based method.  ... 
doi:10.1007/978-3-642-00768-2_6 fatcat:pauyi4ge4beoxkrifvivrqcp6a
« Previous Showing results 1 — 15 out of 8,288 results