Abstract
The classical model for concurrent systems is based on observing execution sequences of global states, separated from each other by atomic transitions. This model is intuitively simple and enjoys a variety of mathematical tools, e.g., finite automata and linear temporal logic, and algorithms that can be applied in order to test and verify concurrent systems. Although this model is sufficient for most frequently used validation tasks, some phenomena of concurrent systems are difficult to express using its related formalisms. In particular, not all the global states (snapshots) related to an execution appear on a particular execution sequence; some appear on equivalent sequences. Previous attempts to move into formalisms that are based on a more detailed model of execution, e.g,. the causality based model, resulted in specification formalisms with inherently high complexity verification algorithms. We study here verification problems that involve allowing the execution sequences model to observe past global states from equivalent executions. We show various algorithms and complexity results related to our extension of the interleaving model.
Chapter PDF
Similar content being viewed by others
References
Alur, R., Chaudhuri, S., Etessami, K., Guha, S., Yannakakis, M.: Compression of Partially Ordered Strings. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 42–56. Springer, Heidelberg (2003)
Alur, R., Etessami, K., Yannakakis, M.: Realizability and Verification of MSC Graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 797–808. Springer, Heidelberg (2001)
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time Temporal Logic. JACM 49(5), 672–713 (2002)
Alur, R., McMillan, K., Peled, D.: Deciding Global Partial-Order Properties. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 41–52. Springer, Heidelberg (1998)
Alur, R., Peled, D., Penczek, W.: Model-Checking of Causality Properties. In: LICS 1995, pp. 90–100 (1995)
Chandy, K.M., Lamport, L.: Distributed Snapshots: Determining the Global State of Distributed Systems. ACM Transactions on Computer Systems 3, 63–75 (1985)
Diekert, V., Gastin, P.: Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 55–69. Springer, Heidelberg (2001)
Diekert, V., Gastin, P.: Pure Future Local Temporal Logics are Expressively Complete for Mazurkiewicz Traces. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 232–241. Springer, Heidelberg (2004)
Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)
Emerson, E.A., Jutla, C.S.: The complexity of Tree Automata and Logics of Programs. In: FOCS 1988 (1988)
Garg, V.K., Waldecker, B.: Detecting Weak Unstable Predicates in Distributed Programs. IEEE Transactions on Parallel and Distributed Systems 5(3), 299–307 (1994)
Gastin, P., Kuske, D.: Satisfiability and Model-Checking for MSO-definable Temporal Logics are in PSPACE. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 222–236. Springer, Heidelberg (2003)
Gastin, P., Mukund, M.: An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 938–949. Springer, Heidelberg (2002)
Gerth, R., Peled, D., Vardi, M., Wolper, P.: Simple on-the-fly Automatic Verification of Linear Temporal Logic. In: PSTV 1995, pp. 3–18 (1995)
Genest, B., Muscholl, A.: Pattern Matching and Membership for Hierarchical Message Sequence Charts. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 326–340. Springer, Heidelberg (2002)
Peled, D., Pnueli, A.: Proving Partial Order Liveness Properties. In: ICALP 1990, pp. 553–571 (1990)
Kuske, D.: Infinite Series-parallel Pomsets: Logic and Languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 648–662. Springer, Heidelberg (2000)
Mazurkiewicz, A.: Trace semantics. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 279–324. Springer, Heidelberg (1987)
Markey, N., Schnoebelen, P.: Model-checking a Path. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 251–265. Springer, Heidelberg (2003)
Peled, D.: Specification and Verification of Message Sequence Charts. In: FORTE/PSTV 2000, pp. 139–154 (2000)
Peled, D., Pnueli, A.: Proving Partial Order Properties. Theoretical Computer Science 126, 143–182 (1994)
Plandowski, W., Rytter, W.: Complexity of Language Recognition Problems for Compressed Words. In: Jewels are Forever, pp. 262–272. Springer, Heidelberg (1999)
Stoller, S., Liu, Y.A.: Efficient Symbolic Detection of Global Properties in Distributed Systems. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 357–368. Springer, Heidelberg (1998)
Thiagarajan, P.S., Walukiewicz, I.: An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. Information and Computation 179(2), 230–249 (2002)
Vardi, M.Y., Wolper, P.: Reasoning About Infinite Computations. Information and Computation 115, 1–37 (1994)
Walukiewicz, I.: Difficult Configurations – On the Complexity of LTrL. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 140–151. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Genest, B., Kuske, D., Muscholl, A., Peled, D. (2005). Snapshot Verification. In: Halbwachs, N., Zuck, L.D. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2005. Lecture Notes in Computer Science, vol 3440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31980-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-31980-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25333-4
Online ISBN: 978-3-540-31980-1
eBook Packages: Computer ScienceComputer Science (R0)