Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management
We consider the problem of parametric verification over a class of systems of processes competing for access to shared resources. We suppose the access to the resources to be controlled according to a FIFO-based policy with a possibility of distinguishing low-priority and high-priority resource requests. We propose a model of the concerned systems based on extended automata with queues. Over this model, we address verification of properties expressed in LTL∖X enriched with global process quantification and interpreted on finite as well as fair behaviours of the given systems. In addition, we examine parametric verification of process deadlockability too. By reducing the parametric verification problems to finite-state model checking, we establish several decidability results for different classes of the considered properties and systems (including the special case of systems with the pure FIFO resource management). Moreover, we show that parametric verification against formulae with local process quantification is undecidable in the given context.
KeywordsModel Check Visible Process Shared Resource Mutual Exclusion Symbolic Model Check
Unable to display preview. Download preview PDF.
- 4.Bouajjani, A., Habermehl, P., Vojnar, T.: Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management, Full version available at http://verif.liafa.jussieu.fr/~vojnar/download/concur03.ps.gz
- 6.Emerson, E., Namjoshi, K.: Reasoning about Rings. In: Proc. of POPL 1995 (1995)Google Scholar
- 7.Emerson, E., Namjoshi, K.: Automatic Verification of Parameterized Synchronous Systems. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102. Springer, Heidelberg (1996)Google Scholar
- 8.Emerson, E., Sistla, A.: Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach. ACM Transactions on Programming Languages and Systems 19(4) (1997)Google Scholar
- 9.German, S., Sistla, A.: Reasoning about Systems with Many Processes. JACM 39(3) (1992)Google Scholar
- 10.Kesten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E.: Symbolic Model Checking with Rich Assertional Languages. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254. Springer, Heidelberg (1997)Google Scholar
- 11.Kurshan, R., McMillan, K.: A Structural Induction Theorem for Processes. Information and Computation 117(1) (1995)Google Scholar
- 13.von Zur Gathen, J., Sieveking, M.: A Bound on Solutions of Linear Integer Equalities and Inequalities. In: Proceedings of the American Mathematical Society (1978)Google Scholar
- 14.Wolper, P., Lovinfosse, V.: Verifying Properties of Large Sets of Processes with Network Invariants. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407. Springer, Heidelberg (1990)Google Scholar