Abstract
Threads as contained in a thread algebra emerge from the behavioral abstraction from programs in an appropriate program algebra. Threads may make use of services such as stacks, and a thread using a single stack is called a pushdown thread. Equivalence of pushdown threads is shown decidable whereas pushdown thread inclusion is undecidable. This is again an example of a borderline crossing where the equivalence problem is decidable, whereas the inclusion problem is not.
Article PDF
References
Zucker J.I. and Bakker J.W. (1982). Processes and the denotational semantics of concurrency. Information Control 54(1/2): 70–120
Bergstra, J.A., Bethke, I.: Polarized process algebra and program equivalence. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) Automata, Languages and Programming, 30th International Colloquium, ICALP, LNCS, vol. 2719, pp. 1–21. Springer, Eindhoven, 30 June–4 July 2003)
Bergstra, J.A., Bethke, I.: Predictable and reliable program code: virtual machine-based projection semantics. In: Electronic Report PRG0603, Programming Research Group, University of Amsterdam. Submitted for inclusion in the Handbook of Network and Systems Administration (2006)
Bergstra J.A. and Klop J.W. (1984). Process algebra for synchronous communication. Information Control 60(1/3): 109–137
Bergstra J.A. and Loots M.E. (2002). Program algebra for sequential code. J. Logic Algebraic Program. 51(2): 125–156
Bergstra, J.A., Middelburg, C.A.: A thread algebra with multi-level strategic interleaving. In: Cooper, S.B., Loewe, B., Torenvliet, L. (eds.) CiE 2005, Springer, LNCS, vol. 3526, pp. 35–48 (2005)
Bergstra J.A. and Ponse A. (2002). Combining programs and state machines. J. Logic Algebraic Program. 51(2): 175–192
Bergstra J.A. and Ponse A. (2007). Execution architectures for program algebra. J. Appl. Logic 5(1): 170–192
Bird M. (1973). The equivalence problem for deterministic two-tape automata. J. Comput. Syst. Sci. 7(2): 218–236
Friedman E.P. (1976). The inclusion problem for simple languages. Theoret. Comput. Sci. 1: 297–316
Greibach S. (1975). Theory of Program Structures: Schemes, Semantics, Verification. Springer, Heidelberg
Jančar, P.: Decidability questions for bisimilarity of Petri nets and some related problems. In: Proceedings of STACS94, LNCS, vol. 775, pp. 581–592. Springer, Heidelberg (1994)
Jančar, P., Moller, F., Sawa, Z.: Simulation problems for one-counter machines. Proceedings of SOFSEM’99: The 26th Seminar on Current Trends in Theory and Practice of Informatics, LNCS, vol. 1725, pp. 398–407. Springer, Heidelberg (1999)
Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Inclusion is undecidable for pattern languages. ICALP 93 LNCS, vol. 700, pp. 301–312. Springer, Heidelberg (1993)
Manna, Z.: Mathematical Theory of Computation. McGraw-Hill, New York (1974)
Minsky M.L. (1961). Recursive unsolvability of post’s problem of “Tag” and other topics in theory of Turing machines. Ann. Math. 74(3): 437–455
Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall International, Englewood Cliffs (1967)
Ohlebush E. and Ukkonen E. (1997). On the equivalence problem for E-pattern languages. Theoret. Comput. Sci. 186(1/2): 231–248
Ponse, A., van der Zwaag, M.B.: Risk assessment for one-counter threads. In: Electronic report PRG0608, Programming Research Group, University of Amsterdam. To appear in Theory of Computing Systems (2006)
Sénizergues, G.: L(A) = L(B)? In: Technical report 1161-97, LaBRI, Université Bordeaux (1997) Available at www.labri.u-bordeaux.fr.
Sénizergues G. (2001). L(A)=L(B)? decidability results from complete formal systems. Theoret. Comput. Sci. 251: 1–166
Stirling C. (2001). Decidability of DPDA equivalence. Theoret. Comput. Sci. 255: 1–31
Valiant L.G. (1974). The equivalence problem for deterministic finite-turn pushdown automata. Information Control 25(2): 123–133
Valiant L.G. and Patterson M. (1975). Deterministic one-counter automata. J. Comput. Syst. Sci. 10(3): 340–350
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Bergstra, J.A., Bethke, I. & Ponse, A. Decision problems for pushdown threads. Acta Informatica 44, 75–90 (2007). https://doi.org/10.1007/s00236-007-0040-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00236-007-0040-5