The paper proposes an approach to solving some verification prob- lems of time Petri nets using linear programming. The approach is based on the observation that for loop-closed time Petri nets, it is only necessary t...The paper proposes an approach to solving some verification prob- lems of time Petri nets using linear programming. The approach is based on the observation that for loop-closed time Petri nets, it is only necessary to investigate a finite prefix of an untimed run of the underlying Petri net. Using the technique the paper gives solutions to reachability and bounded delay timing analysis problems. For both problems algorithms are given, that are decision procedures for loop-closed time Petri nets, and semi-decision procedures for general time Petri nets.展开更多
In this paper, we propose a Multi-granularity Spatial Access Control （MSAC） model, in which multi- granularity spatial objects introduce more types of policy rule conflicts than single-granularity objects do. To ana...In this paper, we propose a Multi-granularity Spatial Access Control （MSAC） model, in which multi- granularity spatial objects introduce more types of policy rule conflicts than single-granularity objects do. To analyze and detect these conflicts, we first analyze the conflict types with respect to the relationship among the policy rules, and then formalize the conflicts by template matrices. We designed a model-checking algorithm to detect potential conflicts by establishing formalized matrices of the policy set. Lastly, we conducted experiments to verify the performance of the algorithm using various spatial data sets and rule sets. The results show that the algorithm can detect all the formalized conflicts. Moreover, the algorithm＇s efficiency is more influenced by the spatial object granularity than the size of the rule set.展开更多
基金Keywords:real-time system, time Petri net, linear programming, model-checkingThis work is supported by the National Natural Sc
文摘The paper proposes an approach to solving some verification prob- lems of time Petri nets using linear programming. The approach is based on the observation that for loop-closed time Petri nets, it is only necessary to investigate a finite prefix of an untimed run of the underlying Petri net. Using the technique the paper gives solutions to reachability and bounded delay timing analysis problems. For both problems algorithms are given, that are decision procedures for loop-closed time Petri nets, and semi-decision procedures for general time Petri nets.
基金supported by the National Natural Science Foundation of China(Nos.51204185 and 41674030)Natural Youth Science Foundation of Jiangsu Province,China(No.BK20140185)+1 种基金China Postdoctoral Science Foundation(No.2016M601909)the Fundamental Research Funds for the Central Universities(No.2014QNA44)
文摘In this paper, we propose a Multi-granularity Spatial Access Control （MSAC） model, in which multi- granularity spatial objects introduce more types of policy rule conflicts than single-granularity objects do. To analyze and detect these conflicts, we first analyze the conflict types with respect to the relationship among the policy rules, and then formalize the conflicts by template matrices. We designed a model-checking algorithm to detect potential conflicts by establishing formalized matrices of the policy set. Lastly, we conducted experiments to verify the performance of the algorithm using various spatial data sets and rule sets. The results show that the algorithm can detect all the formalized conflicts. Moreover, the algorithm＇s efficiency is more influenced by the spatial object granularity than the size of the rule set.
