The regular viewpoint on PA-processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1466, Issue , 1998, Pages 50-66

  Lugiez, D ^a   Schnoebelen, Ph ^b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; POLYNOMIAL APPROXIMATION;

NON DETERMINISM; PARALLEL COMPOSITION; POLYNOMIAL-TIME; PROCESS ALGEBRAS; REGULAR TREE LANGUAGES; TREE AUTOMATA; TREE LANGUAGES; VERIFICATION PROBLEMS;

MODEL CHECKING;

EID: 84945955894     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055615     Document Type: Conference Paper

References (25)

1. J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proc. Parallel Architectures and Languages Europe (PARLE’87), Eindhoven, NL, June 1987, vol. II: Parallel Languages, volume 259 of Lecture Notes in Computer Science, pages 94-111. Springer-Verlag, 1987.
2. O. Burkart and J. Esparza. More infinite results. In Proc. 1st Int. Workshop on Verification of Infinite State Systems (INFINITY’96), Pisa, Italy, Aug. 30-31, 1996, volume 5 of Electronic Notes in Theor. Comp. Sci. Elsevier, 1997.
3. A. Bouajjani, R. Echahed, and P. Habermehl. Verifying infinite state processes with sequential and parallel composition. In Proc. 22nd ACM Syrup. Principles of Programming Languages (POPL’95), San Francisco, CA, USA, Jan. 1995, pages 95-106, 1995.
4. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Appfication to model-checking. In Proc. 8th Int. Conf. Concurrency Theory (CONCUR’97), Warsaw, Poland, Jul. 1997, volume 1243 of Lecture Notes in Computer Science, pages 135-150. Springer-Verlag, 1997.
5. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
6. J. R. Büchi. Regular canonical systems. Arch. Math. Logik Grundlag., 6: 91-111, 1964.
7. D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1): 61-86, 1992.
8. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree automata and their application, 1997. A preliminary version of this (yet unpublished) book is available at http://13ux02.univ-lille3.fr.tata.
9. S. Christensen, Y. Hirshfeld, and F. Moiler. Decidable subsets of CCS. The Computer Journal, 37(4): 233-242, 1994.
10. H. Comon, D. Kozen, H. Seidi, and M. Y. Vardi, editors. Applications of Tree Automata in Rewriting, Logic and Programming, Dagstuhl-Seminar-Report number 193. Schloβ Dagstuhl, Germany, 1997.
11. M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Proc. 5th IEEE Syrup. Logic in Computer Science (LICS’90), Philadelphia, PA, USA, June 1990, pages 242-248, 1990.
12. J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae, 31(1): 13-25, 1997.
13. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems (extended abstract). In Proc. 2nd Int. Workshop on Verification of Infinite State Systems (INFINITY’97), Bologna, Italy, July 11-12, 1997, volume 9 of Electronic Notes in Theor. Comp. Sci. Elsevier, 1997.
14. F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 1, pages 1-68. Springer-Verlag, 1997.
15. Y. Hirshfeld and M. Jerrum. Bisimulation equivalence is decidable for normed Process Algebra. Research Report ECS-LFCS-98-386, Lab. for Foundations of Computer Science, Edinburgh, May 1998.
16. P. Jančar, A. Kučra, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. Tech. Report TUM-I9805, Institut für Informatik, TUM, Munich, Germany, February 1998. To appear in Proc. ICALP’98, Aalborg, DK, July 1998.
17. O. Kouchnarenko and Ph. Schnoebelen. A model for recursive-parallel programs. In Proc. 1st Int. Workshop on Verification of Infinite State Systems (INFINITY’96), Pisa, Italy, Aug. 1996, volume 5 of Electronic Notes in Theor. Comp. Sci. Elsevier, 1997.
18. O. Kushnarenko and Ph. Schnoebelen. A formal framework for the analysis of recursive-parallel programs. In Proc. 4th Int. Conf. Parallel Computing Technologies (PACT’97), Yaroslavl, Russia, Sep. 1997, volume 1277 of Lecture Notes in Computer Science, pages 45-59. Springer-Verlag, 1997.
19. A. Kučera. Regularity is decidable for normed PA processes in polynomial time. In Proc. 16th Conf. Found. of Software Technology and Theor. Comp. Sci. (FST&TCS’96), Hyderabad, India, Dec. 1996, volume 1180 of Lecture Notes in Computer Science, pages 111-122. Springer-Verlag, 1996.
20. A. Kučera. How to parallelize sequential processes. In Proc. 8th Int. Conf. Concurrency Theory (CONCUR’97), Warsaw, Poland, Jul. 1997, volume 1243 of Lecture Notes in Computer Science, pages 302-316. Springer-Verlag, 1997.
21. R. Mayr. Combining Petri nets and PA-processes. In Proc. 4th Int. Syrup. Theoretical Aspects Computer Software (TACS’97), Sendal, Japan, Sep. 1997, volume 1281 of Lecture Notes in Computer Science, pages 547-561. Springer-Verlag, 1997.
22. R. Mayr. Model checking PA-proeesses. In Proc. 8th Int. Conf. Concurrency Theory (CONCUR’97), Warsaw, Poland, Jul. 1997, volume 1243 of Lecture Notes in Computer Science, pages 332-346. Springer-Verlag, 1997.
23. R. Mayr. Tableaux methods for PA-processes. In Proc. Int. Conf. Automated Reasoning with Analytical Tableaux and Related Methods (TABLEA UX’97), Pont-à-Mousson, France, May 1997, volume 1227 of Lecture Notes in Artificial Intelligence, pages 276-290. Springer-Verlag, 1997.
24. F. Moiler. Infinite results. In Proc. 7th Int. Conf. Concurrency Theory (CONCUR’96), Pisa, Italy, Aug. 1996, volume 1119 of Lecture Notes in Computer Science, pages 195-216. Springer-Verlag, 1996.
25. J.-C. Raoult. Rational tree relations. Bull. Belg. Math. Soc., 4: 149-176, 1997.