SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Theoretical Computer Science

Volumn 274, Issue 1-2, 2002, Pages 89-115

The regular viewpoint on PA-processes

(2) Lugiez, D a Schnoebelen, Ph b

a AIX MARSEILLE UNIVERSITY (France)

b CNRS (France)

Author keywords

Process algebra; Tree automata; Verification of infinite state systems

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; ITERATIVE METHODS; MATHEMATICAL MODELS; PETRI NETS; POLYNOMIALS; SET THEORY; TREES (MATHEMATICS);

PROCESS ALGEBRA;

AUTOMATA THEORY;

EID: 0037028853 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(00)00306-6 Document Type: Conference Paper

Times cited : (31)

References (33)

1
- 0003650163
- Cambridge University Press, Cambridge
- (1998) Term Rewriting and All That
- Baader, F.¹ Nipkow, T.²

2
- 85035072034
- Decidability of bisimulation equivalence for processes generating context-free languages
- Proc. Parallel Architectures and Languages Europe, PARLE'87, Eindhoven, NL, June 1987, Parallel Languages, vol. II. Springer, Berlin
- (1987) Lecture Notes in Computer Science , vol.259 , pp. 94-111
- Baeten, J.C.M.¹ Bergstra, J.A.² Klop, J.W.³

3
- 0003947115
- Cambridge University Press, Cambridge
- (1990) Process Algebra, Cambridge Tracts in Theoretical Computer Science , vol.18
- Baeten, J.C.M.¹ Weijland, W.P.²

4
- 0001667648
- An automata-theoretic approach to branching-time model checking
- (2000) J. ACM , vol.47 , Issue.2 , pp. 312-360
- Kupferman, O.¹ Vardi, M.Y.² Wolper, P.³

5
- 84944409047
- Reachability analysis of pushdown automata: Application to model-checking
- Proc. 8th Internat Conf. Concurrency Theory, CONCUR'97, Warsaw, Poland, July 1997, Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1243 , pp. 135-150
- Bouajjani, A.¹ Esparza, J.² Maler, O.³

6
- 27144502798
- Regular canonical systems
- (1964) Arch. Math. Logik Grundlag , vol.6 , pp. 91-111
- Büchi, J.R.¹

7
- 0003363352
- More infinite results
- Proc. 1st Internat. Workshop on Verification of Infinite State Systems, INFINITY'96, Pisa, Italy, August 1996, Elsevier, Amsterdam
- (1997) Electronic Notes in Theoretical Computer Science , vol.5
- Burkart, O.¹ Esparza, J.²

8
- 0026944928
- On the regular structure of prefix rewriting
- (1992) Theoret. Comput. Sci. , vol.106 , Issue.1 , pp. 61-86
- Caucal, D.¹

9
- 0004029701
- Ph.D. Thesis CST-105-93, Department of Computer Science, University of Edinburgh, UK
- (1993) Decidability and decomposition in process algebras
- Christensen, S.¹

10
- 0028744867
- Decidable subsets of CCS
- (1994) Comput. J. , vol.37 , Issue.4 , pp. 233-242
- Christensen, S.¹ Hirshfeld, Y.² Moller, F.³

11
- 0004060205
- A preliminary version of this electronic book
- (1997) Tree Automata Techniques and Applications
- Comon, H.¹ Dauchet, M.² Gilleron, R.³ Jasquemard, F.⁴ Lugiez, D.⁵ Tison, S.⁶ Tommasi, M.⁷

12
- 0008603019
- Applications of tree automata in rewriting, logic and programming
- Schloß Dagstuhl, Germany
- (1997) Dagstuhl-Seminar-Report No. 193
- Comon, H.¹ Kozen, D.² Seidl, H.³ Vardi, M.Y.⁴

13
- 0025596345
- The theory of ground rewrite systems is decidable
- Philadelphia, PA, USA, June 1990
- (1990) Proc. 5th IEEE Symp. Logic in Computer Science, LICS'90 , pp. 242-248
- Dauchet, M.¹ Tison, S.²

14
- 0031185722
- Petri nets, commutative context-free grammars, and basic parallel processes
- (1997) Fund. Inform. , vol.31 , Issue.1 , pp. 13-25
- Esparza, J.¹

15
- 33745656232
- An automata-theoretic approach to interprocedural data-flow analysis
- Proc. Conf. Foundations of Software Science and Computation Structures, FoSSaCS'99, Amsterdam, The Netherlands, March 1999, Springer, Berlin
- (1999) Lecture Notes in Computer Science , vol.1578
- Esparza, J.¹ Knoop, J.²

16
- 0003246762
- A direct symbolic approach to model checking pushdown systems (extended abstract)
- Proc. 2nd Internat. Workshop on Verification of Infinite State Systems, INFINITY'97, Bologna, Italy, July 1997, Elsevier, Amsterdam
- (1997) Electronic Notes in Theoretical Computer Science , vol.9
- Finkel, A.¹ Willems, B.² Wolper, P.³

17
- 0003002778
- Tree languages
- G. Rozenberg, A. Salomaa (Eds.), Springer, Berlin, Chapter 1
- (1997) Handbook of Formal Languages , vol.3 , pp. 1-68
- Gécseg, F.¹ Steinby, M.²

18
- 84974776376
- The reachability problem for ground TRS and some extensions
- Proc. Internat. J. Conf. Theory and Practice of Software Development, TAPSOFT'89, Barcelona, Spain, March 1989, vol. 1, Springer, Berlin
- (1989) Lecture Notes in Computer Science , vol.351 , pp. 227-243
- Gilleron, R.¹ Deruyver, A.²

19
- 84887479359
- Bisimulation equivalence is decidable for normed process algebra
- Proc. 26th Internat. Coll. Automata, Languages, and Programming, ICALP'99, Prague, Czech Republic, July 1999, Springer, Berlin
- (1999) Lecture Notes in Computer Science , vol.1644 , pp. 412-421
- Hirshfeld, Y.¹ Jerrum, M.²

20
- 84878552423
- Deciding bisimulation-like equivalences with finite-state processes
- Proc. 25th Internat Coll. Automata, Languages, and Programming, ICALP'98, Aalborg, Denmark, July 1998, Springer, Berlin
- (1998) Lecture Notes in Computer Science , vol.1443 , pp. 200-211
- Jančar, P.¹ Kučera, A.² Mayr, R.³

21
- 0003338302
- A model for recursive-parallel programs
- Proc. 1st Internat Workshop on Verification of Infinite State Systems, INFINITY'96, Pisa, Italy, August 1996, Elsevier, Amsterdam
- (1997) Electronic Notes in Theoretical Computer Science , vol.5
- Kouchnarenko, O.¹ Schnoebelen, Ph.²

22
- 84947916996
- Regularity is decidable for normed PA processes in polynomial time
- Proc. 16th Conf. Foundation of Software Technology and Theoretical Computer Science, FST&TCS'96, Hyderabad, India, December 1996, Springer, Berlin
- (1996) Lecture Notes in Computer Science , vol.1180 , pp. 111-122
- Kučera, A.¹

23
- 84957885780
- How to parallelize sequential processes
- Proc. 8th Internat. Conf. Concurrency Theory, CONCUR'97, Warsaw, Poland, July 1997, Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1243 , pp. 302-316
- Kučera, A.¹

24
- 0005740801
- A formal framework for the analysis of recursive-parallel programs
- Proc. 4th Internat. Conf. Parallel Computing Technologies, PaCT'97, Yaroslavl, Russia, September 1997, Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1277 , pp. 45-59
- Kushnarenko, O.¹ Schnoebelen, Ph.²

25
- 0003300181
- Combining Petri nets and PA-processes
- Proc. Internat. Symp. Theoretical Aspects of Computer Software, TACS'97, Sendai, Japan, September, 1997, Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1281 , pp. 547-561
- Mayr, R.¹

26
- 0000926680
- Model checking PA-processes
- Proc. 8th Internat. Conf. Concurrency Theory, CONCUR'97, Warsaw, Poland, July 1997, Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1243 , pp. 332-346
- Mayr, R.¹

27
- 84958771474
- Tableaux methods for PA-processes
- Proc. Internat. Conf. Automated Reasoning with Analytical Tableaux and Related Methods, TABLEAUX'97, Pont-à-Mousson, France, May 1997, Springer, Berlin
- (1997) Lecture Notes in Artificial Intelligence , vol.1227 , pp. 276-290
- Mayr, R.¹

28
- 0003954103
- Prentice-Hall, Englewood Cliffs, NJ
- (1989) Communication and Concurrency
- Milner, R.¹

29
- 84955565828
- Infinite results
- Proc. 7th Internat. Conf. Concurrency Theory, CONCUR'96, Pisa, Italy, August 1996, Springer, Berlin
- (1996) Lecture Notes in Computer Science , vol.1119 , pp. 195-216
- Moller, F.¹

30
- 0008565929
- Rational tree relations
- (1997) Bull. Belg. Math. Soc. , vol.4 , pp. 149-176
- Raoult, J.-C.¹

31
- 0000923255
- Decomposable regular languages and the shuffle operator
- (1999) EATCS Bull. , vol.67 , pp. 283-289
- Schnoebelen, Ph.¹

32
- 0033698872
- Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
- Boston, MA, USA, January 2000, ACM Press
- (2000) Proc. 27th ACM Symp. Principles of Programming Languages (POPL'2000) , pp. 1-11
- Espurza, J.¹ Podelski, A.²

33
- 84974652645
- Decidable first-order transition logics for PA-processes
- Proc. 27th Internat. Coll. Automata, Languages, and Programming, ICALP'2000, Geneva, Switzerland, July 2000, Springer, Berlin
- (2000) Lecture Notes in Computer Science , vol.1853 , pp. 342-353
- Lugiez, D.¹ Schnoebelen, Ph.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.