Abstract
We present a local model checking algorithm that decides for a given contextfree process whether it satisfies a property written in the alternation-free modal mu-calculus. Heart of this algorithm is a purely syntactical sound and complete formal system, which in contrast to the known tableau techniques, uses intermediate higher-order assertions. These assertions provide a finite representation of all the infinite state sets which may arise during the proof in terms of the finite representation of the context-free argument process. This is the key to the effectiveness of our local model checking procedure.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Andersen, H., Model checking on boolean graphs. ESOP '92, LNCS 582 (1992), 1–19.
Bradfield, J.C., Verifying temporal properties of systems. Birkhäuser, Boston (1992).
Bradfield, J.C., and Stirling, C. P., Verifying temporal properties of processes. Proc. CONCUR '90, LNCS 458 (1990), 115–125.
Burkart, O., and Steffen, B., Model checking for context-free processes. CONCUR '92, LNCS 630 (1992), 123–137.
Clarke, E.M., Emerson, E.A., and Sistla, A.P., Automatic verification of finite state concurrent systems using temporal logic specifications. ACM TOPLAS 8 (1986), 244–263.
Cleaveland, R., Tableau-based model checking in the prepositional mu-calculus. Acta Inf. 27 (1990), 725–747.
Cleaveland, R., Parrow, J., and Steffen, B., The concurrency workbench. Workshop Automatic Verification Methods for Finite-State Systems, LNCS 407 (1989), 24–37.
Cleaveland, R., and Steffen, B., Computing behavioral relations, logically. ICALP '91, LNCS 510 (1991).
Cleaveland, R., and Steffen, B., A linear-time model-checking algorithm for the alternation-free modal mu-calculus. CAV 91, LNCS 575 (1992), 48–58.
Emerson, E.A., and Lei, C.-L., Efficient model checking in fragments of the prepositional mu-calculus. 1st LiCS (1986), 267–278.
Huynh, D.T., and Tian, L., Deciding bisimilarity of normed context-free processes is in σ p2 . Tech. Rep. UTDCS-1-92, Univ. Texas Dallas (1992).
Kozen, D., Results on the prepositional Μ-calculus. TCS 27 (1983), 333–354.
Larsen, K. G., Proof systems for satisfiability in Hennessy-Milner logic with recursion. TCS 72 (1990), 265–288.
Larsen, K.G., Efficient local correctness checking. CAV '92.
Stirling, C. P., and Walker, D. J., Local model checking in the modal mu-calculus. TAPSOFT '89, LNCS 351 (1989), 369–383.
Winskel, G., A note on model checking the modal mu-calculus. ICALP '89, LNCS 372 (1989), 761–772.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hungar, H., Steffen, B. (1993). Local model checking for context-free processes. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_105
Download citation
DOI: https://doi.org/10.1007/3-540-56939-1_105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56939-8
Online ISBN: 978-3-540-47826-3
eBook Packages: Springer Book Archive