On Complexity of Grammars Related to the Safety Problem
Leftist grammars were introduced by Motwani et. al., who established the relationship between the complexity of accessibility problem (or safety problem) for certain general protection system and the membership problem of these grammars. The membership problem for leftist grammars is decidable. This implies the decidability of the accessibility problem. It is shown that the membership problem for leftist grammars is PSPACE-hard. Therefore, the accessibility problem in the appropriate protection systems is PSPACE-hard as well. Furthermore, the PSPACE-hardness result is adopted to very restricted class of leftist grammars, if the grammar is a part of the input.
KeywordsProtection System Production Rule Trust Management Safety Problem Derivation Step
Unable to display preview. Download preview PDF.
- 1.Bandyopadhyay, S., Mahajan, M., Kumar, K.N.: A non-regular leftist language. Manuscript (2005)Google Scholar
- 4.Cheiner, O., Saraswat, V.: Security Analysis of Matrix. Technical report, AT&T Shannon Laboratory (1999)Google Scholar
- 9.Motwani, R., Panigrahy, R., Saraswat, V.A., Venkatasubramanian, S.: On the decidability of accessibility problems (extended abstract). STOC, 306–315 (2000)Google Scholar
- 10.Saraswat, V.: The Matrix Design. Technical report, AT&T Laboratory (April 1997)Google Scholar