Abstract
Decidability of modal logics is not limited to finite systems. The alternation-free mu-calculus can be model checked for sequential systems given in a context-free form (or even a more general one). But the parallel composition of such systems introduces undecidabilities. Nevertheless, several instances can be handled as it is shown in this paper. The known model check techniques prove to be not extendable to parallel compositions. A new tableau system is introduced which is complete in the sequential case and for parallel compositions involving at most one infinite system. The verification of a queue which results from the parallel composition of two (context-free) stacks demonstrates its ability to cope with nontrivial compositions of infinite systems, too.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bergstra, J.A., and Klop, J.W., Process theory based on bisimulation semantics. LNCS 354 (eds de Bakker, de Roever, Rozenberg) (1988), 50–122.
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 ‘80, LNCS 458 (1990), 115–125.
Büchi, J.R., Regular canonical systems. Archiv f. math. Logik and Grundlagen-forschung 6 (1964) 91–111.
Burkart, O., and Steffen, B., Model checking for context-free processes. CONCUR ‘82, LNCS 630 (1992), 123–137.
Burkart, O., and Steffen, B., Pushdown processes: Parallel composition and model checking. Tech. Rep. Aachen/Passau (1994), 17 p.
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 propositional mu-calculus. Acta Inf. 27 (1990), 725–747.
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. (1986), 1–32.
Emerson, E.A., and Lei, C.-L., Efficient model checking in fragments of the propositional mu-calculus. 1st LiCS (1986), 267–278.
Hungar, H. Local model checking of higher-order processes, Technical Report, Oldenburg (1994), 13 p.
Hungar, H., and Steffen, B., Local model checking for context-free processes. ICALP’93, LNCS 700 (1993), 593–605.
Kozen, D., Results on the propositional μ-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 ‘82.
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
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hungar, H. (1994). Local Model Checking for Parallel Compositions of Context-Free Processes. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-48654-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58329-5
Online ISBN: 978-3-540-48654-1
eBook Packages: Springer Book Archive