Decidable First-Order Transition Logics for PA-Processes
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 342-353
- https://doi.org/10.1007/3-540-45022-x_30
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Parametric quantitative temporal reasoningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The theory of ground rewrite systems is decidablePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient algorithms for pre* and post* on interprocedural parallel flow graphsPublished by Association for Computing Machinery (ACM) ,2000
- Process Rewrite SystemsInformation and Computation, 2000
- Timed Automata and the Theory of Real NumbersPublished by Springer Nature ,1999
- Infinite resultsPublished by Springer Nature ,1996
- Verifying infinite state processes with sequential and parallel compositionPublished by Association for Computing Machinery (ACM) ,1995
- Finite tree automata with cost functionsTheoretical Computer Science, 1994
- A really temporal logicJournal of the ACM, 1994
- Process AlgebraPublished by Cambridge University Press (CUP) ,1990