Abstract
In this paper, techniques are proposed for limiting state explosion in the context of resource allocation problems. It is shown that given any system organized into a—possibly irregular—network of n—possibly heterogeneous — processes, model checking over that system can be reduced by an efficient, fully automatic and exact method to model checking over a certain small system. These results are established for correctness properties expressed in LTLX. The precise size and topology of the small system are dependent on the large system, as well as the correctness specification. When the network is symmetric and the processes homogeneous, this new method provides an efficient solution to the Parameterized Model Checking Problem. As an application, it is shown how to efficiently verify a variety of solutions to the parameterized Dining Philosophers Problem.
This work was supported in part by NSF grant CCR-009-8141, SRC contract 99-TJ-685, and TARP-003685-0650-1999.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. ParameterizedVerification withAutomatically Computed Inductive Assertions. CAV 2001, LNCS, 2001.
K. Apt and D. Kozen. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters, 15, pages 307–309, 1986.
M.C. Browne, E.M. Clarke and O. Grumberg. Reasoning about Networks with Many Identical Finite State Processes. Information and Control, 81(1), pages 13–31, April 1989.
R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers. C-35(8). pp 677–691, August 1986.
J.R. Burch, E.M. Clarke, K. L. McMillan, D.L. Dill and L.J. Hwang. Symbolic model checking: 1020 states and beyond. LICS 1990.
K.M. Chandy and J. Misra. The Drinking Philosophers Problem. ACM Transactions on Programming Languages and Systems, Vol. 6, No. 4, pp 632–646, 1984.
E.M. Clarke, T. Filkorn and S. Jha. Exploiting Symmetry in Temporal Model Checking. In Computer Aided Verification, Proceedings of the 5th International Conference. LNCS 697, Springer-Verlag, 1993.
E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logics. In Proceedings of the IBMWorkshop on Logics of Programs, LNCS 131, 1981.
E.M. Clarke and O. Grumberg. Avoiding the State Explosion Problem in Temporal Logic Model Checking Algorithms. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 294–303, 1987.
E.M. Clarke, O. Grumberg and S. Jha. Verifying Parameterized Networks using Abstraction and Regular Languages. In CONCUR’ 95: Concurrency Theory, Proceedings of the 6th International Conference, LNCS 962, pages 395–407, Springer-Verlag, 1995.
E. A. Emerson, J. Havlicek and R. Trefler. Virtual Symmetry. LICS 2000.
E.A. Emerson and V. Kahlon. Reducing Model Checking of theMany to the Few. In Automated Deduction—CADE-17, LNAI 1831, Springer, pages 236–254, 2000.
E.A. Emerson and V. Kahlon. Model Checking Large-scale and Parameterized Resource Allocation Systems. Tech. Report, The Univ. of Texas at Austin, 2001.
E.A. Emerson and K.S. Namjoshi. Reasoning about Rings. In Conference Record of POPL’ 95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 85–94, 1995.
E.A. Emerson and K.S. Namjoshi. Automatic Verification of Parameterized Synchronous Systems. In Computer Aided Verification, Proceedings of the 8th International Conference. LNCS, Springer-Verlag, 1996.
E.A. Emerson and A.P. Sistla. Symmetry and Model Checking. In Computer Aided Verification, Proceedings of the 5th International Conference. LNCS 697, Springer-Verlag, 1993.
E.A. Emerson and A.P. Sistla. Utilizing Symmetry when Model-Checking under Fairness Assumptions: An Automata-Theoretic Approach. ACM Trans. on Prog. Lang. and Systems (TOPLAS), pp. 617–638, vol. 19, no. 4, July 1997.
E. Emerson and R. Trefler. From Asymmetry to Full Symmetry. CHARME99, LNCS, 1999.
S.M. German and A.P. Sistla. Reasoning about Systems with Many Processes. J. ACM,39(3), July 1992.
P. Godefroid and P. Wolper. Using Partial orders for the efficient verification of deadlockfreedom and safety properties. Formal Methods in Systems Design. 2(2), pp 149–164, 1993.
C. N. Ip and D. Dill,Verifying Systems with Replicated Components in Murphi, pp. 147–158 CAV 1996.
R. P. Kurshan and K. L. McMillan. A Structural Induction Theorem for Processes. In Proceedings of the Eight Annual ACMSymposium on Principles of Distributed Computing, pages 239–247, 1989.
M. Maidl. A Unifying Model Checking Approach for Safety Properties of Parameterized Systems. CAV 2001, LNCS, 2001.
D. Peled. Combining partial order reductions with on-the-fly model checking. Formal Aspects of Computing, 8, pp 39–64, 1996.
A. Pnueli, S. Ruah, and L. Zuck. Automatic Deductive Verification with Invisible Invariants. TACAS 2001, LNCS, 2001.
A. P. Sistla. Parameterized Verification of Linear Networks Using Automata as Invariants, CAV, 1997, 412–423.
P. Wolper and V. Lovinfosse. Verifying Properties of Large Sets of Processes with Network Invariants. In J. Sifakis(ed) AutomaticVerification Methods for Finite State Systems, Springer-Verlag, LNCS 407, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Emerson, E.A., Kahlon, V. (2002). Model Checking Large-Scale and Parameterized Resource Allocation Systems. In: Katoen, JP., Stevens, P. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2002. Lecture Notes in Computer Science, vol 2280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46002-0_18
Download citation
DOI: https://doi.org/10.1007/3-540-46002-0_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43419-1
Online ISBN: 978-3-540-46002-2
eBook Packages: Springer Book Archive