Decision problems for pushdown threads

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...

Full description

Saved in:
Bibliographic Details
Published inActa informatica Vol. 44; no. 2; pp. 75 - 90
Main Authors BERGSTRA, Jan A, BETHKE, Inge, PONSE, Alban
Format Journal Article
LanguageEnglish
Published Berlin Springer 01.05.2007
Springer Nature B.V
Subjects
Algebra
Algorithmics. Computability. Computer arithmetics
Applied sciences
Behavior
Computer science; control theory; systems
Decision making
Equivalence
Exact sciences and technology
Inclusions
Language theory and syntactical analysis
Science
Stacks
Studies
Theoretical computing
Computer theory
Language theory
Stack
Online AccessGet full text

Cover

More Information
Summary: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. [PUBLICATION ABSTRACT]
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0001-5903
1432-0525
DOI:10.1007/s00236-007-0040-5