Automata model for verifying attibuted-based access control policy in systems with a finite number of objects

DOI10.3103/S002713222105003XzbMath1487.68069OpenAlexW4210485997WikidataQ114845116 ScholiaQ114845116MaRDI QIDQ2131407

S. A. Afonin, A. L. Kuznetsova

Publication date: 26 April 2022

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s002713222105003x

zbMATH Keywords

decidabilityfinite automatoninformation securityABACpolicy validation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computer security (68M25)

Cites Work

• Automatic Structures: Richness and Limitations
• Unnamed Item

This page was built for publication: Automata model for verifying attibuted-based access control policy in systems with a finite number of objects