Abstract
The paper shows how to use partitioning techniques to generate abstract state spaces (models) preserving similarity and injectivity. Since these relations are weaker than bisimilarity and surjectivity, our algorithms generate smaller models. This method can be applied for improving several existing partitioning algorithms used for generating finite models of concurrent programs, Time Petri Nets and Timed Automata.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
[ACD+92a]_R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi, An implementation of three algorithms for timing verification based on automata emptiness, Proc. of the 13th IEEE Real-Time Systems Symposium (RTSS’92), IEEE Soc. Press, 1992, pp. 157–166.
[ACD+92b]_R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi, Minimization of timed transition systems, Proc. of CONCUR’92, LNCS, vol. 630, Springer-Verlag, 1992, pp. 340–354.
M. C. Browne, E. M. Clarke, and O. Grumberg, Characterizing finite Kripke structures in propositional temporal logic, Theoretical Computer Science 59(1/2) (1988), 115–131.
[BFH+92]_A. Bouajjani, J-C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel, Minimal state graph generation, Science of Computer Programming 18 (1992), 247–269.
D. Bustan and O. Grumberg, Simulation based minimization, Proc. of the 17th Int. Conf. on Automated Deduction (ICAD’2000) (Pittsburgh), 2000, pp. 255–270.
D. Dill, Timing assumptions and verification of finite state concurrent systems, Automatic Verification Methods for Finite-State Systems, LNCS, vol. 407, Springer-Verlag, 1989, pp. 197–212.
U. Goltz, R. Kuiper, and W. Penczek, Propositional temporal logics and equivalences, Proc. of CONCUR’92, LNCS, vol. 630, Springer-Verlag, 1992, pp. 222–236.
O. Grumberg and D. E. Long, Model checking and modular verification, Proc. of CONCUR’91, LNCS, vol. 527, Springer-Verlag, 1991, pp. 250–265.
M. Henzinger, T. Henzinger, and P. Kopke, Computing simulations on finite and infinite graphs, Proc. of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS’95), 1995, pp. 453–462.
W. Penczek and A. Półrola, Abstractions and partial order reductions for checking branching properties of Time Petri Nets, Proc. of the Int. Conf. on Applications and Theory of Petri Nets (ICATPN’01), LNCS, vol. 2075, Springer-Verlag, 2001, pp. 323–342.
S. Tripakis and S. Yovine, Analysis of timed systems based on time-abstracting bisimulations, Proc. of CAV’96, LNCS, vol. 1102, Springer-Verlag, 1996, pp. 232–243.
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
Dembiński, P., Penczek, W., Pólrola, A. (2002). Automated Verification of Infinite State Concurrent Systems. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_27
Download citation
DOI: https://doi.org/10.1007/3-540-48086-2_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43792-5
Online ISBN: 978-3-540-48086-0
eBook Packages: Springer Book Archive