Coloured petri nets and the invariant-method

Jensen, Kurt Villads

doi:10.1016/0304-3975(81)90049-9

Cited by 508 publications

(140 citation statements)

References 2 publications

Supporting

Mentioning

125

Contrasting

Unclassified

Order By: Relevance

“…Net models similar to Petri nets with data have been continuously proposed since the 80s, including, among the others, high-level Petri nets [13], colored Petri nets [17], unordered and ordered data nets [21], ν-Petri nets [25], and constraint multiset rewriting [5,8,9]. Petri nets with data can be also considered as a reinterpretation of the classical definition of Petri nets in sets with atoms [3,4], where one allows for orbit-finite sets of places and transitions instead of just finite ones.…”

Section: Relatedmentioning

confidence: 99%

WQO Dichotomy for 3-Graphs

Lasota

Piórkowski

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We investigate data-enriched models, like Petri nets with data, where executability of a transition is conditioned by a relation between data values involved. Decidability status of various decision problems in such models may depend on the structure of data domain. According to the WQO Dichotomy Conjecture, if a data domain is homogeneous then it either exhibits a well quasi-order (in which case decidability follows by standard arguments), or essentially all the decision problems are undecidable for Petri nets over that data domain.We confirm the conjecture for data domains being 3-graphs (graphs with 2-colored edges). On the technical level, this results is a significant step beyond known classification results for homogeneous structures.

show abstract

Section: Relatedmentioning

confidence: 99%

WQO Dichotomy for 3-Graphs

Lasota

Piórkowski

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…There are related Petri net models, e.g., with typed tokens [15] and with predicates on transitions [10]. Here, we have incorporated the aspects that are critically necessary to capture access control policies.…”

Section: Definition 4 (Conservative Transitions)mentioning

confidence: 99%

Access Nets: Modeling Access to Physical Spaces

Frohardt

Chang

Sankaranarayanan

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Electronic, software-managed mechanisms using, for example, radiofrequency identification (RFID) cards, enable great flexibility in specifying access control policies to physical spaces. For example, access rights may vary based on time of day or could differ in normal versus emergency situations. With such fine-grained control, understanding and reasoning about what a policy permits becomes surprisingly difficult requiring knowledge of permission levels, spatial layout, and time. In this paper, we present a formal modeling framework, called ACCESS NETS, suitable for describing a combination of access permissions, physical spaces, and temporal constraints. Furthermore, we provide evidence that model checking techniques are effective in reasoning about physical access control policies. We describe our results from a tool that uses reachability analysis to validate security policies.

show abstract

“…Different extensions to ordinary PNs have been developed in order to increase the modeling convenience and/or the modeling power. Colored PNs (CPNs) introduced by K. Jensen are one such extension [Jensen, 1981]. The latter allow a type (color) to be attached to a token.…”

Section: Definition 1 An Ordinary Petri Net (Pn) Is a 5-tuplementioning

confidence: 99%