2019
DOI: 10.1007/s10207-019-00448-9
|View full text |Cite|
|
Sign up to set email alerts
|

Using Hierarchical Timed Coloured Petri Nets in the formal study of TRBAC security policies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 30 publications
0
6
0
Order By: Relevance
“…Policy analysis mainly deals with policy evaluation and anomaly analysis: checking for errors like incorrect policy specifications, conflicts and sub-optimizations affecting either a single policy or a set of policies [3] being the primary research topic. Works in this area use different techniques to achieve this goal, such as model checking [17], [18], binary decision diagrams [19], graph theory [20], Deterministic Finite State Automata (DFSA) [21], First Order Logic (FOL) [22], geometrical models [23], answer set programming [24], petri nets [25] and metagraphs [15]. Policy evaluation instead deals with checking whether a request is satisfied by a set of policies.…”
Section: Introductionmentioning
confidence: 99%
“…Policy analysis mainly deals with policy evaluation and anomaly analysis: checking for errors like incorrect policy specifications, conflicts and sub-optimizations affecting either a single policy or a set of policies [3] being the primary research topic. Works in this area use different techniques to achieve this goal, such as model checking [17], [18], binary decision diagrams [19], graph theory [20], Deterministic Finite State Automata (DFSA) [21], First Order Logic (FOL) [22], geometrical models [23], answer set programming [24], petri nets [25] and metagraphs [15]. Policy evaluation instead deals with checking whether a request is satisfied by a set of policies.…”
Section: Introductionmentioning
confidence: 99%
“…Policy analysis mainly deals with policy evaluation and anomaly analysis: checking for errors such as incorrect policy specifications, conflicts and sub-optimizations affecting either a single policy or a set of policies [16] being the primary research topic. Works in this area use different techniques to achieve this goal, such as model checking [51,52], binary decision diagrams [53], graph theory [54], Deterministic Finite State Automata (DFSA) [55], First Order Logic (FOL) [56], geometrical models [57], answer set programming [58], petri nets [59] and metagraphs [32].…”
Section: Related Workmentioning
confidence: 99%
“…Because the accessibility of the TPZN involves limited time and there are lots of the state classes, some methods to reduce the state classes are necessary. For instance, Bourdil and Berthomieu have proposed some methods to reduce the state classes [28,31]. Based on their work, we use Z frame to abstract the system so to reduce the state number.…”
Section: Theorem 1 If the Global Execution Time Of Every Transition Sequence Of The New Refined Tpzn Model From The Beginning To The End mentioning
confidence: 99%
“…It not only has continuous part time but also has discrete time. Some researchers used time Petri nets to model the requirements and software of system [29][30][31][32][33][34], but it lacked specific rule descriptions and state depictions.…”
Section: Introductionmentioning
confidence: 99%