메뉴 건너뛰기




Volumn 36, Issue 4, 2002, Pages 341-358

About the decision of reachability for register machines

Author keywords

Infinite state systems; Verification

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; FUNCTIONS; ITERATIVE METHODS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PETRI NETS; THEOREM PROVING; VECTORS;

EID: 0036818397     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2003001     Document Type: Article
Times cited : (8)

References (9)
  • 2
    • 4244060600 scopus 로고    scopus 로고
    • Symbolic methods for exploring infinite sate spaces
    • Ph.D. Thesis. Université de Liège
    • B. Boigelot, Symbolic Methods for Exploring Infinite Sate Spaces, Ph.D. Thesis. Université de Liège (1998) 225.
    • (1998) , pp. 225
    • Boigelot, B.1
  • 4
    • 4243999784 scopus 로고    scopus 로고
    • Vérification de systèmes à compteurs
    • (in French), Master's Thesis. Université Paris 7
    • V. Cortier, Vérification de systèmes à compteurs (in French), Master's Thesis. Université Paris 7 (1999) http://www.lsv.ens-cachan.fr/~cortier/memoire_dea.ps
    • (1999)
    • Cortier, V.1
  • 5
    • 0000709547 scopus 로고
    • Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors
    • L.E. Dickson, Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35 (1913) 413-422.
    • (1913) Amer. J. Math. , vol.35 , pp. 413-422
    • Dickson, L.E.1
  • 7
    • 0003754682 scopus 로고    scopus 로고
    • A well-structured framework for analysing Petri nets extensions
    • Technical Report, Research Report LSV-99-2
    • A. Finkel, P. McKenzie and C. Picaronny, A well-structured framework for analysing Petri nets extensions. Technical Report, Research Report LSV-99-2 (1999) http://www.lsv.ens-cachan.fr/Publis/RAPPORT_LSV/rr-lsv-1999-2.rr.ps
    • (1999)
    • Finkel, A.1    Mckenzie, P.2    Picaronny, C.3


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