Petri Net Reachability Graphs: Decidability Status of First Order Properties

Darondeau, Philippe; Demri, Stéphane; Meyer, Roland; Morvan, Christophe

doi:10.2168/lmcs-8(4:9)2012

Cited by 7 publications

(6 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2 Later, connections to the theory of Petri nets, in particular, the famous reachability problem, and in this way also connections to many interesting properties of models for concurrent computations became a vivid research topic. We refrain from giving detailed further references here, as this would be surely beyond this short historical summary; the interested reader can find many more references within the following papers: [10,17,22,74].…”

Section: Discussion Of Related Conceptsmentioning

confidence: 99%

Characterization and complexity results on jumping finite automata

Fernau

Paramasivan

Schmid

et al. 2017

Theoretical Computer Science

View full text Add to dashboard Cite

In a jumping finite automaton, the input head can jump to an arbitrary position within the remaining input after reading and consuming a symbol. We characterize the corresponding class of languages in terms of special shuffle expressions and survey other equivalent notions from the existing literature. Moreover, we present several results concerning computational hardness and algorithms for parsing and other basic tasks concerning jumping finite automata.Proposition 10. Let M 1 , M 2 , M 3 be arbitrary languages.

show abstract

Section: Discussion Of Related Conceptsmentioning

confidence: 99%

Characterization and complexity results on jumping finite automata

Fernau

Paramasivan

Schmid

et al. 2017

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…Previous Works on Formal Models. A large body of research on reachability analysis is conducted over formal models [33], such as finite-state systems [11,, Petri nets [8,39,40,66] and timed automata [5]. For these models, precise decidability and complexity results are attained.…”

Section: Introductionmentioning

confidence: 99%

Polynomial reachability witnesses via Stellensätze

Asadi

Chatterjee

et al. 2021

Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

We consider the fundamental problem of reachability analysis over imperative programs with real variables. Previous works that tackle reachability are either unable to handle programs consisting of general loops (e.g. symbolic execution), or lack completeness guarantees (e.g. abstract interpretation), or are not automated (e.g. incorrectness logic). In contrast, we propose a novel approach for reachability analysis that can handle general and complex loops, is complete, and can be entirely automated for a wide family of programs. Through the notion of Inductive Reachability Witnesses (IRWs), our approach extends ideas from both invariant generation and termination to reachability analysis.We first show that our IRW-based approach is sound and complete for reachability analysis of imperative programs. Then, we focus on linear and polynomial programs and develop automated methods for synthesizing linear and polynomial IRWs. In the linear case, we follow the well-known approaches using Farkas' Lemma. Our main contribution is in the polynomial case, where we present a push-button semicomplete algorithm. We achieve this using a novel combination of classical theorems in real algebraic geometry, such as Putinar's Positivstellensatz and Hilbert's Strong Nullstellensatz. Finally, our experimental results show we can prove

show abstract

“…“UA_new” is capable of recognizing PPI for the restricted user assignment. The duplication arrangement of UA and additional arcs represents a 4% increase above our original simulation, in terms of state space in reachability‐graph computation 17 …”

Section: Objectives and Methodsmentioning

confidence: 96%

“…The duplication arrangement of UA and additional arcs represents a 4% increase above our original simulation, in terms of state space in reachability-graph computation. 17 Please note that the second half of the RC-10 scheme cannot be simulated, as our model only maps user interactions.…”

Section: Integration Of Newly Added Access Decision-makingmentioning

confidence: 99%

Towards unobtrusive patient‐centric access‐control for Health Information System

Carvalho

Bandiera-Paiva

2020

Concurrency and Computation

View full text Add to dashboard Cite

Patient consent is currently a missing piece on Health Information Systems (HIS) access permission. The control is needed to ensure personal data as the property of the individual, not data controllers or health-care service providers. This is a newly-designed access-decision flow for HIS secured by Role-Based Access Control (RBAC) including patient-centric control. It makes use of Colored Petri-Nets (CPN) to model RBAC restrictions. A Discretionary Access Control (DAC) functionality is added to Electronic Health-Records (EHR) control to convey a patient's explicit authorization to their data in a non-obstructive access flow. Mutual exclusion was designed to incorporate patient needs so that they could authorize healthcare professionals to access EHR data. Additional information was supplied to a PERMS Access Control matrix and this enabled DAC to be mimicked using existing RBAC Core functions. A minimal addition is proposed to incorporate RBAC-aware systems with no significant drawbacks when compared with previous CPN simulations. The article also discusses the limitations of this technique and the favorable conditions for implementing new features.

show abstract

Petri Net Reachability Graphs: Decidability Status of First Order Properties

Cited by 7 publications

References 41 publications

Characterization and complexity results on jumping finite automata

Characterization and complexity results on jumping finite automata

Polynomial reachability witnesses via Stellensätze

Towards unobtrusive patient‐centric access‐control for Health Information System

Contact Info

Product

Resources

About