Abstract
Formulas of temporal logic which cannot distinguish between different interleavings of the same run are said to be trace consistent. So called partial-order methods can be applied for verification of such formulas, since checking such a property over an equivalence class of runs reduces to checking it for one representative.
In this paper, we present inference rules that typify this kind of reasoning. The rules lead us to a complete axiomatization of a linear time temporal logic, all formulas of which are trace consistent. The axiomatization is presented in a layered manner so that we can attempt to isolate the global reasoning required.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Diekert, V., Gastin, P. and Petit, A., “Rational and recognizable complex trace languages”, Information and Computation, vol 116, #1, 1995, 134–153.
Godefroid, P. and Wolper, P., “A partial approach to model checking”, Information and Computation, vol 110, 1994, 305–326.
Katz, S. and Peled, D., “Interleaving set temporal logic”, TCS, vol. 73, #3, 1992, 21–43.
Peled, D., “All from one and one from all: on model checking using representatives”, Proc. CAV, LNCS 697, 1993, 409–423.
Peled, D., Wilke, T. and Wolper, P., “An algorithmic approach to proving closure properties of ω-regular language”, Proc. CONCUR, LNCS 1119, 1996.
Ramanujam, R., “Locally linear time temporal logic”, Proc. IEEE LICS, 1996, 118–127.
Ramanujam, R., “Axiomatization of a partial order based temporal logic”, Bericht Nr 9605, Christian-Albrechts Universität Kiel, June 1996.
Ramanujam, R., “Trace consistency and inevitability”, Proc. FST and TCS, LNCS 1180, 1996, 250–261.
Rushby, J., “Mechanized formal methods: progress and prospects”, Proc. FST and TCS, LNCS 1180, 1996, 43–51.
Thiagarajan, P.S., “A trace based extension of propositional linear time temporal logic”, Proc. IEEE LICS, 1994, 438–447.
Thiagarajan, P.S., “A trace consistent subset of PTL”, Proc. CONCUR, LNCS 962, 1995, 438–452.
Thiagarajan, P.S. and Walukiewicz, I., “An expressively complete linear time temporal logic for Mazurkiewicz traces”, Proc. IEEE LICS, 1997.
Valmari, A., “A stubborn attack on state explosion”, Proc. CAV, LNCS 531, 1990, 156–165.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramanujam, R. (1997). Rules for trace consistent reasoning. In: Shyamasundar, R.K., Ueda, K. (eds) Advances in Computing Science — ASIAN'97. ASIAN 1997. Lecture Notes in Computer Science, vol 1345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63875-X_43
Download citation
DOI: https://doi.org/10.1007/3-540-63875-X_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63875-9
Online ISBN: 978-3-540-69658-2
eBook Packages: Springer Book Archive