Abstract
By extending regular Propositional Dynamic Logic (PDL) with simple recursive propositions, we obtain a language which has enough expressiveness to allow interesting applications while still enjoying a relatively simple decision procedure. More specifically, it is strictly more expressive than the regular PDL and not more expressive than the single alternation fragment of the modal μ-calculus. We present a decision procedure for satisfiability of a large class of so called simple formulas. The decision procedure has a time complexity which is polynomial in the size of the programs and exponential in the number of the sub-formulas. We show a way to solve process equations of weak bisimulation as an application.
Keywords
- specification
- labeled transition systems
- propositional dynamic logic
- modal μ-calculus
- fixed point
- satisfiability
Research supported by ANR-NSFC 61161130530.
This is a preview of subscription content, access via your 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
Larsen, K.: Modal Specifications. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 232–246. Springer, Heidelberg (1990)
Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press (2000)
Kozen, D.: Results on the propositional mu–calculus. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 348–359. Springer, Heidelberg (1982)
Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. System Sci. 18(2) (1979)
Lange, M.: Model checking propositional dynamic logic with all extras. Journal of Applied Logic 4 (2006)
Leivant, D.: Propositional Dynamic Logic for Recursive Procedures. In: Shankar, N., Woodcock, J. (eds.) VSTTE 2008. LNCS, vol. 5295, pp. 6–14. Springer, Heidelberg (2008)
Löding, C., Lutz, C., Serre, O.: Propositional dynamic logic with recursive programs. Journal Logic and Algebraic Programming 73 (2007)
Clarke, E., Grumberg Jr., O., Peled, D.: Model checking. MIT Press (1999)
Liu, X., Xue, B.: Recursive pdl with nesting (in preparing)
Liu, X., Xue, B.: Decomposition of pdl and its extension. Submitted to International Conference on Computer Science, Hongkong (2012)
Streett, R.S., Emerson, E.A.: An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation 81, 249–264 (1989)
Kozen, D., Parikh, R.: A decision procedure for the propositional mu–calculus. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol. 164, pp. 313–325. Springer, Heidelberg (1984)
Jonsson, B., Larsen, K.: On the Complexity of Equation Solving in Process Algebra. In: Abramsky, S. (ed.) TAPSOFT 1991. LNCS, vol. 493, pp. 381–396. Springer, Heidelberg (1991)
Larsen, K., Liu, X.: Compositionality Through an Operational Semantics of Contexts. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 526–539. Springer, Heidelberg (1990)
Milner, R.: Communication and Concurrency. Prentice–Hall (1989)
Walukiewicz, I.: Notes on the propositional μ-calculus: completeness and related results, brics nots series, Tech. Rep. NS-95-1 (1995)
Larsen, K., Liu, X.: Equation solving using modal transition systems. In: Proceedings on Logic in Computer Science (1990)
Liu, X.: Specification and decomposition in concurrency, Ph.D. dissertation, University of Aalborg, Fredrik Bajers Vej 7, DK 9220 Aalborg ø, Denmark (1992)
Larsen, K., Xinxin, L.: On equation solving. In: Larsen, K., Skou, A. (eds.) 2nd NOrdic Workshop on Program Correctness (1990)
Larsen, K.G.: Compositional Theories based on an Operational Semantics of Contexts. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1989. LNCS, vol. 430, pp. 487–518. Springer, Heidelberg (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, X., Xue, B. (2012). Specification in PDL with Recursion. In: Goodloe, A.E., Person, S. (eds) NASA Formal Methods. NFM 2012. Lecture Notes in Computer Science, vol 7226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28891-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-28891-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28890-6
Online ISBN: 978-3-642-28891-3
eBook Packages: Computer ScienceComputer Science (R0)
