Process algebra
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
Decidability of model checking with the temporal logic EF
Theoretical Computer Science
The regular viewpoint on PA-processes
Theoretical Computer Science
Parametric Temporal Logic for "Model Measuring"
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Deciding Bisimulation-Like Equivalences with Finite-State Processes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
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
Synchronized Tree Languages Revisited and New Applications
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
| Hi-index | 0.00 |
We show decidability of several first-order logics based upon the reachability predicate in PA. The main tool we use is the recognizability by tree automata of the reachability relation between PA-processes. This approach and the transition logics we use allow a smooth and general treatment of parameterized model checking for PA. Then the logic is extended to handle a 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.