Senescent Ground Tree Rewrite Systems

被引：0

作者：

Hague, M. ^{[1
]}

机构：

[1] Royal Holloway Univ London, Egham, Surrey, England

来源：

PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS) | 2014年

基金：

英国工程与自然科学研究理事会;

关键词：

Ground tree rewrite systems; ground term rewrite systems; automata; concurrency; scope-bounding; bounded-context switches; under-approximation; reachability; petri-nets; reset petri-nets; Ackermann-hard; pushdown systems; MODEL CHECKING; LTL;

D O I：

10.1145/2603088.2603112

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Ground Tree Rewrite Systems with State are known to have an undecidable control state reachability problem. Taking inspiration from the recent introduction of scope-bounded multi-stack pushdown systems, we define Senescent Ground Tree Rewrite Systems. These are a restriction of ground tree rewrite systems with state such that nodes of the tree may no longer be rewritten after having witnessed an a priori fixed number of control state changes. As well as generalising scope-bounded multi-stack pushdown systems, we show - via reductions to and from reset Petri-nets - that these systems have an Ackermann-complete control state reachability problem. However, reachability of a regular set of trees remains undecidable.

引用

页数：10

共 50 条

[1] Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems
Goeller, Stefan
Lin, Anthony Widjaja
CONCUR 2011: CONCURRENCY THEORY, 2011, 6901 : 543 - +
[2] Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems
Goeller, Stefan
Lin, Anthony Widjaja
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2014, 15 (04)
[3] The Complexity of Verifying Ground Tree Rewrite Systems
Goeller, Stefan
Lin, Anthony Widjaja
26TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2011), 2011, : 279 - 288
[4] Deterministic bottom-up tree transducers and ground term rewrite systems
Sandor Vagvoelgyi
THEORETICAL COMPUTER SCIENCE, 2009, 410 (21-23) : 2250 - 2278
[5] Regular tree languages and rewrite systems
Fundam Inf, 1-2 (157):
[6] Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems
Guillem Godoy
Ashish Tiwari
Rakesh Verma
Applicable Algebra in Engineering, Communication and Computing, 2004, 15 : 13 - 36
[7] Characterizing confluence by rewrite closure and right ground term rewrite systems
Godoy, G
Tiwari, A
Verma, R
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2004, 15 (01) : 13 - 36
[8] DECIDABILITY OF THE CONFLUENCE OF FINITE GROUND TERM REWRITE SYSTEMS AND OF OTHER RELATED TERM REWRITE SYSTEMS
DAUCHET, M
HEUILLARD, T
LESCANNE, P
TISON, S
INFORMATION AND COMPUTATION, 1990, 88 (02) : 187 - 201
[9] The First-Order Theory of Ground Tree Rewrite Graphs
Goeller, Stefan
Lohrey, Markus
IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 276 - 287
[10] Congruential complements of ground term rewrite systems
Vágvölgyi, S
THEORETICAL COMPUTER SCIENCE, 2000, 238 (1-2) : 247 - 274

← 1 2 3 4 5 →