Alternating automata, the weak monadic theory of trees and its complexity
Theoretical Computer Science
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation - Special issue on EXPRESS 1997
Petri nets and regular processes
Journal of Computer and System Sciences
Pushdown automata, multiset automata, and Petri nets
Theoretical Computer Science
Deciding bisimulation-like equivalences with finite-state processes
Theoretical Computer Science
Communication and Concurrency
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
High Undecidability of Weak Bisimilarity for Petri Nets
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
The Regular Viewpoint on PA-Processes
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Formal and natural computing
On the Verification Problem of Nonregular Properties for Nonregular Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Decidability Issues for Extended Ping-Pong Protocols
Journal of Automated Reasoning
On decidability of LTL model checking for process rewrite systems
Acta Informatica
Recursion versus replication in simple cryptographic protocols
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Reachability of hennessy-milner properties for weakly extended PRS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Reachability problem for weak multi-pushdown automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
Process rewrite systems (PRS) are widely accepted as a formalism for the description of infinite-state systems. It is known that the reachability problem for PRS is decidable. The problem becomes undecidable when PRS are extended with a finite-state control unit. In this paper, we show that the problem remains decidable when PRS are extended with a weak (i.e. acyclic except for self-loops) finite-state control unit. We also present some applications of this decidability result.