A Reduction Method of Timed Petri Nets for a Hierarchical Scheduling

1995 ◽  
Vol 115 (7) ◽  
pp. 914-919
Author(s):  
Kazuyuki Mori ◽  
Makoto Tsukiyama ◽  
Toyoo Fukuda
Keyword(s):  
Petri Nets ◽  
Reduction Method ◽  
Timed Petri Nets ◽  
Hierarchical Scheduling

Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets

2013 ◽  
Vol E96.A (2) ◽  
pp. 540-553
Author(s):  
Satoru OCHIIWA ◽  
Satoshi TAOKA ◽  
Masahiro YAMAUCHI ◽  
Toshimasa WATANABE
Keyword(s):  
Petri Nets ◽  
Heuristic Algorithms ◽  
Timed Petri Nets

A Compositional Semantics for Timed Petri Nets1

1990 ◽  
Vol 13 (2) ◽  
pp. 141-170
Author(s):  
Andrea Maggiolo-Schettini ◽  
Józef Winkowski
Keyword(s):  
Petri Nets ◽  
Compositional Semantics ◽  
Timed Petri Nets ◽  
Event Structures ◽  
Configuration Systems

Timed Petri nets and their behaviours are considered. A concept of a seminet is introduced. which generalizes the concept of a net, and suitable operations on seminets are defined, which allow constructing seminets from atoms corresponding to places and transitions. The behaviours of seminets are given in the form of so called configuration systems, a notion close to labelled event structures. Such behaviours can be combined with the aid of operations corresponding to those on seminets. In particular, the behaviour of a compound seminet can be obtained by combining the behaviours of components.

Resource Allocation Strategy in Fog Computing Based on Priced Timed Petri Nets

2017 ◽  
Vol 4 (5) ◽  
pp. 1216-1228 ◽  
Author(s):  
Lina Ni ◽  
Jinquan Zhang ◽  
Changjun Jiang ◽  
Chungang Yan ◽  
Kan Yu
Keyword(s):  
Resource Allocation ◽  
Petri Nets ◽  
Fog Computing ◽  
Allocation Strategy ◽  
Timed Petri Nets ◽  
Resource Allocation Strategy
Sign in / Sign up

Export Citation Format

Share Document