메뉴 건너뛰기




Volumn 1853, Issue , 2000, Pages 342-353

Decidable first-order transition logics for PA-processes

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER CIRCUITS; MODEL CHECKING; ROBOTS;

EID: 84974652645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_30     Document Type: Conference Paper
Times cited : (4)

References (25)
  • 2
    • 0028202370 scopus 로고
    • A really temporal logic
    • R. Alur and T. A. Henzinger. A really temporal logic. J. of the ACM, 41(1):181-203, 1994.
    • (1994) J. of the ACM , vol.41 , Issue.1 , pp. 181-203
    • Alur, R.1    Henzinger, T.A.2
  • 7
    • 84888234004 scopus 로고    scopus 로고
    • Timed automata and the theory of real numbers
    • Springer
    • H. Comon and Y. Jurski. Timed automata and the theory of real numbers. In Proc. 10th Int. Conf. Concurrency Theory, vol. 1664 of L.N.C.S., pages 242-257. Springer, 1999.
    • (1999) Proc. 10Th Int. Conf. Concurrency Theory , pp. 242-257
    • Comon, H.1    Jurski, Y.2
  • 9
  • 11
    • 0031185722 scopus 로고    scopus 로고
    • Petri nets, commutative context-free grammars, and basic parallel processes
    • J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae, 31(1):13-25, 1997.
    • (1997) Fundamenta Informaticae , vol.31 , Issue.1 , pp. 13-25
    • Esparza, J.1
  • 14
    • 84878552423 scopus 로고    scopus 로고
    • Deciding bisimulation-like equivalences with finite-state 201 449 243 461 processes
    • Springer
    • P. Jançar, A. Kučra, and R. Mayr. Deciding bisimulation-like equivalences with finite-state 201 449 243 461 processes. In Proc. 25th Int. Coll. Automata, Languages, and Programming, vol. 1443 of L.N.C.S., pages 200-211. Springer, 1998.
    • (1998) Proc. 25Th Int. Coll. Automata, Languages, and Programming , pp. 200-211
    • Jançar, P.1    Kučra, A.2    Mayr, R.3
  • 18
    • 84958771474 scopus 로고    scopus 로고
    • Tableaux methods for PA-processes
    • Springer
    • R. Mayr. Tableaux methods for PA-processes. In Proc. TABLEAUX'97, vol. 1227 of L.N.A.I., pages 276-290. Springer, 1997.
    • (1997) Proc. TABLEAUX'97, Vol. 1227 of L.N.A.I , pp. 276-290
    • Mayr, R.1
  • 20
    • 0034627955 scopus 로고    scopus 로고
    • Process rewrite systems
    • R. Mayr. Process rewrite systems. Information and Computation, 156(1/2):264-286, 2000.
    • (2000) Information and Computation , vol.156 , Issue.1-2 , pp. 264-286
    • Mayr, R.1
  • 22
    • 0000457926 scopus 로고
    • On context-free languages
    • R. J. Parikh. On context-free languages. J.A.C.M, 13(4):570-581, 1966.
    • (1966) J.A.C.M , vol.13 , Issue.4 , pp. 570-581
    • Parikh, R.J.1
  • 24
    • 0000923255 scopus 로고    scopus 로고
    • Decomposable regular languages and the shuffle operator
    • Ph. Schnoebelen. Decomposable regular languages and the shuffle operator. EATCS Bull., 67:283-289, 1999.
    • (1999) EATCS Bull. , vol.67 , pp. 283-289
    • Schnoebelen, P.H.1
  • 25
    • 0028413877 scopus 로고
    • Finite tree automata with cost function
    • H. Seidl. Finite tree automata with cost function. Theoretical Computer Science, 126(1):113-142, 1994.
    • (1994) Theoretical Computer Science , vol.126 , Issue.1 , pp. 113-142
    • Seidl, H.1


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