Abstract
In this paper, we consider a strict generalization of context-free processes, the pushdown processes, which are particularly interesting for three reasons: First, in contrast to context-free processes that do not support the construction of distributed systems, they are closed under parallel composition with finite state systems. Second, they are the smallest extension of context-free processes allowing parallel composition with finite state processes. Third, they can be model checked by means of an elegant adaptation to pushdown automata of the second order model checker introduced in [BuS92]. As arbitrary parallel composition between context-free processes provides Turing power, and therefore destroys every hope for automatic verification, pushdown processes can be considered as the appropriate generalization of context-free processes for frameworks for automatic verification.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. Technical Report CS-R8632, CWI, September 1987.
J.C. Bradfield. Verifying Temporal Properties of Systems with Applications to Petri Nets. PhD thesis, University of Edinburgh, 1991.
J.C. Bradfield and C. Stirling. Local Model Checking for Infinite State Spaces. Technical Report ECS-LFCS-90–115, LFCS, Edinburgh, Jun 1991.
O. Burkart and B. Steffen. Model Checking for Context-Free Processes. In CONCUR ‘82, LNCS 630, pages 123–137. Springer, 1992.
O. Burkart and B. Steffen. Composition, Decomposition and Model Checking of Pushdown Processes. Technical Report MIP-9402, Universität Passau, 1994.
E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 8 (2): 244–263, 1986.
S. Christensen, H. Hüttel, and C. Stirling. Bisimulation Equivalence is Decidable for all Context-Free Processes. In CONCUR ‘82, LNCS 630, pages 138–147. Springer, 1992.
R. Cleaveland, M. Klein, and B. Steffen. Faster Model Checking for the Modal Mu-Calculus. In CAV ‘82, LNCS 663, pages 410–422, 1992.
R. Cleaveland. Tableau-Based Model Checking in the Propositional Mu-Calculus. Acta Informatica, 27: 725–747, 1990.
D. Caucal and R. Monfort. On the Transition Graphs of Automata and Grammars. In Graph-Theoretic Concepts in Computer Science, LNCS 484, pages 311–337. Springer, 1990.
R. Cleaveland and B. Steffen. Computing Behavioural Relations, Logically. In ICALP ‘81, LNCS 510, pages 127–138. Springer, 1991.
R. Cleaveland and B. Steffen. A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. In CAV ‘81, LNCS 575, pages 48–58. Springer, 1992.
E.A. Emerson and C.-L. Lei. Efficient Model Checking in Fragments of the Propositional Mu-Calculus. In Proc. 1th Annual Syrup. on Logic in Computer Science, pages 267–278. IEEE Computer Society Press, 1986.
H. Hüttel. Decidability, Behavioural Equivalences and Infinite Transition Graphs. PhD thesis, University of Edinburgh, Dec 1991. CST-86–91.
C.A.R. Hoare. Communicating Sequential Processes. Prentice—Hall, 1988.
H. Hungar and B. Steffen. Local Model-Checking for Context-Free Processes. In ICALP ‘83, LNCS 700, pages 593–605, 1993.
D. Kozen. Results on the Propositional μ-Calculus. Theoretical Computer Science, 27: 333–354, 1983.
K.G. Larsen. Proof Systems for Hennessy—Milner Logic with Recursion. In CAAP ‘88, LNCS’ 299, pages 215–230. Springer, 1988.
R. Milner. Communication and Concurrency. Prentice—Hall, 1989.
D.E. Muller and P.E. Schupp. The Theory of Ends, Pushdown Automata, and Second-Order Logic. Theoretical Computer Science, 37: 51–75, 1985.
S. Purushothaman Iyer. A Note on Model Checking Context-Free Processes. In NA PAW ‘83, 1993. To appear in LNCS.
C. Stirling and D. Walker. Local Model Checking in the Modal Mu-Calculus. In TAPSOFT ‘89, LNCS 351, pages 369–383. Springer, 1989.
A. Tarski. A Lattice-Theoretical Fixpoint Theorem and its Applications. Pacific Journal of Mathematics, 5: 285–309, 1955.
G. Winskel. A Note on Model Checking the Modal Mu-Calculus. In ICALP ‘89, LNCS 372, pages 761–772. Springer, 1989.
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
Burkart, O., Steffen, B. (1994). Pushdown Processes: Parallel Composition and Model Checking. 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-48654-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58329-5
Online ISBN: 978-3-540-48654-1
eBook Packages: Springer Book Archive