Information and Computation - Special issue on EXPRESS 1997
"Sometimes" and "not never" revisited: on branching versus linear time (preliminary report)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Pushdown Processes: Parallel Composition and Model Checking
CONCUR '94 Proceedings of the Concurrency Theory
Constrained Properties, Semilinear Systems, and Petri Nets
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On the Complexity of the Linear-Time mu -calculus for Petri-Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
On the Decidability of Model Checking for Several µ-calculi and Petri Nets
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Model-Checking Large Finite-State Systems and Beyond
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On decidability of LTL model checking for process rewrite systems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
We consider the model checking problem for Process Rewrite Systems (PRSs), an infinite-state formalism (non Turing-powerful) which subsumes many common models such as Pushdown Processes and Petri Nets. PRSs can be adopted as formal models for programs with dynamic creation and synchronization of concurrent processes, and with recursive procedures. The model-checking problem for PRSs w.r.t. action-based linear temporal logic (ALTL) is undecidable. However, decidability for some interesting fragment of ALTL remains an open question. In this paper we state decidability results concerning generalized acceptance properties about infinite derivations (infinite term rewriting) in PRSs. As a consequence, we obtain decidability of the model-checking (restricted to infinite runs) for PRSs and a meaningful fragment of ALTL.