Abstract
A finite representation of the prime event structure corresponding to the behaviour of a program is suggested. The algorithm of linear complexity using this representation for model checking of the formulas of Discrete Event Structure Logic without past modalities is given. A method of building finite representations of event structures in an efficient way by applying partial order reductions is provided.
Partially supported by The State Committee for Scientific Research under the grant No. 8 T11C 029 08
Chapter PDF
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
R. Alur, D. Peled, and W. Penczek, Model-Checking of Causality Properties, Proc. of LICS'95, pp. 90–100, 1995
L. Bolc, A. Szalas, eds., Time and Logic: A Computational Approach, UCL Press Ltd., London, 1995.
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. ACM Transactions on Programming Languages and Systems, 8(2):244–263, 1986.
J. Desel and J. Esparza, Free choice Petri Nets, Cambridge tracts in TCS 40, Cambridge University Press, 1995.
V. Diekert and G. Rozenberg, editors. Book of Traces. World Scientific, Singapore. 1995.
E.A. Emerson. Temporal and Modal Logic. In J. van Leeuven, editor, Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics, The MIT Press Elsevier, pp. 995–1067, 1990.
R. Gerth, R. Kuiper, D. Peled, and W. Penczek, A partial order approach to branching time logic model checking, Proc. of the Israeli Conference on Theoretical Computer Science, IEEE Computer Society Press, pp. 130–139, 1995.
M. Huhn and P. Niebert, Towards automata for branching time and partial order, Proc. of CONCUR'96, LNCS 1119, pp. 611–626, 1996.
K. Lodaya and P.S. Thiagarajan, A modal logic for a subclass of event structures, LNCS 267, Springer-Verlag, pp. 290–303, 1987.
O. Lichtenstein, A. Pnueli, Checking that finite-state concurrent programs satisfy their linear specification. Proc. 11th ACM POPL, pp. 97–107, 1984.
K.L. McMillan, A technique of a state space search based on unfolding. Formal Methods in System Design 6 (1), pp. 45–65, 1995.
A. Mazurkiewicz, Basic notions of trace theory, LNCS 354, pp. 285–363, 1988.
M. Mukund, P.S. Thiagarajan, An Axiomatization of Well Branching Prime Event Structures. Theoretical Computer Science 96, pp. 35–72, 1992.
M. Mukund and P.S. Thiagarajan, Linear time temporal logics over Mazurkiewicz traces, Proceedings of MFCS'96, LNCS 1113, pp. 62–92, 1996.
P. Niebert, A μ-calculus with local views for systems of sequential agents, Proc. of MFCS'95, LNCS 969, pp. 563–573, 1995.
M. Nielslen and G. Winskel, Trace structures and other models for concurrency, a chapter in [5].
D. Peled, Partial order reductions: model-checking using representatives, Proc. of MFCS'96, LNCS 1113, pp. 93–112, 1996.
D. Peled, A. Pnueli, Proving partial order properties. Theoretical Computer Science 126, 143–182, 1994.
W. Penczek, A temporal logic for event structures, Fundamenta Informaticae XI, pp. 297–326, 1988.
W. Penczek, A Temporal Logic for the Local Specification of Concurrent Systems. Information Processing IFIP-89, pp. 857–862, 1989.
W. Penczek, Temporal logics on trace systems: on automated verification, International Journal of Foundations of Computer Science, Vol. 4 No. 1, pp. 31–67, 1993.
W. Penczek, Branching time and partial order in temporal logics, chapter 4 in [2].
W. Penczek and R. Kuiper, ”Traces and Logic”, a chapter in [5].
S. Pinter and P. Wolper, A temporal logic for reasoning about partially ordered computations. Proc. 3rd ACM PODC, 28–37, 1984.
R.E. Tarjan, Depth first search and linear graph algorithms, SIAM Journal of Computing, 1(2), pp. 146–160, 1972.
P.S. Thiagarajan, A Trace Based Extension of Linear Time Temporal Logic. Proc. 10th IEEE LICS, pp. 438–447, 1994.
B. Vergauwen and J. Levi, A linear local model checking algorithm for CTL, Proc. of CONCUR'93, LNCS 715, pp. 447–461, 1993.
G. Winskel, Event structures, in: W. Brauer, W. Reisig, G. Rozenberg (eds.), Advances in Petri Nets 1986, LNCS 255, pp. 279–324, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Penczek, W. (1997). Model-checking for a subclass of event structures. In: Brinksma, E. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1997. Lecture Notes in Computer Science, vol 1217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035386
Download citation
DOI: https://doi.org/10.1007/BFb0035386
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62790-6
Online ISBN: 978-3-540-68519-7
eBook Packages: Springer Book Archive