, Volume 44, Issue 2, pp 75-90,
Open Access This content is freely available online to anyone, anywhere at any time.
Date: 22 Mar 2007

Decision problems for pushdown threads

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.