Abstract
If synchronizing (rendez-vous) communications are used in the Promela models, the unless construct and the weak fairness algorithm are not compatible with the partial order reduction algorithm used in Spin’s verifier. After identifying the wrong partial order reduction pattern that causes the incompatibility, we give solutions for these two problems. To this end we propose corrections in the identification of the safe statements for partial order reduction and as an alternative, we discuss corrections of the partial order reduction algorithm.
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
Bengtsson, J., Jonsson, B, Lilius, J., Yi, W., Partial Order Reductions for TimedSystems, CONCUR’98, LNCS 1466, pp. 485–501, 1998.
Bo-sna-cki, D., Dams, D., Integrating Real Time in Spin: a Prototype Implementation, FORTE/PSTV’98, Kluwer, pp. 423–439, 1998
Bouajjani, A., Tripakis, S., Yovine, S., On-the-Fly Symbolic Model-Checking for Real-Time Systems, In Proc. of the 18th IEEE Real-Time Systems Symposium, pp. 232–243, IEEE, 1997 56 Dragan Bo-sna-cki
Clarke, E., Emerson, E., Sistla, A., Automatic Verification of Finite-state Concurrent Systems Using Temporal Logic Specifications, ACM Transactions on Programming Languages and Systems, 8(2), pp. 244–263, 1986
Courcoubetis, C., Vardi, M., Wolper, P., Yannakakis, M., Memory Efficient Al-gorithms for the Verification of Temporal Properties, Formal Methods in System DesignI, pp. 275–288, 1992
Dams, D., Gerth, R., Knaack, B., Kuiper, R., Partial-order Reduction Techniquesfor Real-time Model Checking, FMICS’98, CWI, pp.157–170, 1998
Francez, N., Fairness, Springer, 1986
Godefroid, P., Partial Order Methods for the Verification of Concurrents Systems An Approach to the State Space Explosion, LNCS 1032, Springer, 1996
Holzmann, G. J., Design and Validation of Communication Protocols, Prentice Hall, 1991. Also: amp;http://netlib.bell-labs.com/netlib/spin/whatispin.html
Holzmann, G. J., Personal communication
Holzmann, G., Peled, D., An Improvement in Formal Verification, FORTE 1994, Bern, Switzerland, 1994.
Holzmann, G., Peled, D., Yannakakis On Nested Depth First Search, Proc. of the 2nd Spin Workshop, Rutgers University, New Jersay, USA, 1996.
Pagani, F., Partial Orders and Verification of Real Time Systems, Formal Techniques in Real Time and Fault Tolerant Systems FTRTFT 96, LNCS, 1996
Peled, D., Combining Partial Order Reductions with On-the-Fly Model Checking, Computer Aided Verification 1994, LCNS 818, pp. 377–390, 1994.
Vardi, M., Wolper, P., Automata Theoretic Techniques for Modal Logics of Programs, Journal of Computer and System Science, 32(2), pp. 182–221, 1986
Willems, B., Wolper, P., Partial Order Models for Model Checking: From Linear to Branching Time, Proc. of 11 Symposium of Logics in Computer Science, LICS 96, New Brunswick, pp. 294–303, 1996
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bošnački, D. (1999). Partial Order Reduction in Presence of Rendez-vous Communications with Unless Constructs and Weak Fairness. In: Dams, D., Gerth, R., Leue, S., Massink, M. (eds) Theoretical and Practical Aspects of SPIN Model Checking. SPIN 1999. Lecture Notes in Computer Science, vol 1680. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48234-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-48234-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66499-4
Online ISBN: 978-3-540-48234-5
eBook Packages: Springer Book Archive