Process algebra
Handbook of theoretical computer science (vol. B)
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Finite tree automata with cost functions
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Verifying infinite state processes with sequential and parallel composition
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Journal of the ACM (JACM)
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
Symbolic model checking with rich assertional languages
Theoretical Computer Science
Decidability of model checking with the temporal logic EF
Theoretical Computer Science
Deciding bisimulation-like equivalences with finite-state processes
Theoretical Computer Science
Parametric temporal logic for “model measuring”
ACM Transactions on Computational Logic (TOCL)
The regular viewpoint on PA-processes
Theoretical Computer Science
An automata-theoretic approach to the reachability analysis of RPPS systems
Nordic Journal of Computing
How to Parallelize Sequential Processes
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Regularity is Decidable for Normed PA Processes in Polynomial Time
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Tableau Methods for PA-Processes
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
On the Verification Problem of Nonregular Properties for Nonregular Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Parametric Quantitative Temporal Reasoning
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
ACM Transactions on Computational Logic (TOCL)
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
On a conjecture of schnoebelen
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Recurrent Reachability Analysis in Regular Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizability by tree automata of the reachability relation. The tree automata approach and the transition logics we use allow a smooth and general treatment of parameterized model checking for PA. This approach is extended to handle a quite general notion of costs of PA-steps. In particular, when costs are Parikh images of traces, we show decidability of a transition logic extended by some form of first-order reasoning over costs.