메뉴 건너뛰기




Volumn 1755, Issue , 2000, Pages 208-220

Some decidability results for nested petri nets

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; HIERARCHICAL SYSTEMS;

EID: 84943272789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46562-6_18     Document Type: Conference Paper
Times cited : (46)

References (19)
  • 2
    • 0004456632 scopus 로고
    • Some decision problems related to the reachability problem for Petri nets
    • T. Araki and T. Kasami. Some decision problems related to the reachability problem for Petri nets. Theoretical Computer Science, 3(1):85-104, 1977.
    • (1977) Theoretical Computer Science , vol.3 , Issue.1 , pp. 85-104
    • Araki, T.1    Kasami, T.2
  • 7
    • 0025628292 scopus 로고
    • Reduction and covering of infinite reachability trees
    • A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144-179, 1990.
    • (1990) Information and Computation , vol.89 , Issue.2 , pp. 144-179
    • Finkel, A.1
  • 14
    • 0039301269 scopus 로고    scopus 로고
    • Modelling of multi-agent dynamic systems by nested Petri nets (In Russian), August 1998
    • Moscow: Nauka
    • I. A. Lomazova. Modelling of multi-agent dynamic systems by nested Petri nets (in Russian), August 1998. In Programmnye Sistemy: Teoreticheskie Osnovy i Prilozheniya, pages 143-156, Moscow: Nauka, 1999.
    • (1999) Programmnye Sistemy: Teoreticheskie Osnovy I Prilozheniya , pp. 143-156
    • Lomazova, I.A.1
  • 18
    • 84943233270 scopus 로고    scopus 로고
    • A survey on high-level Petri-net theory
    • E. Smith. A survey on high-level Petri-net theory. EATCS Bull., 59:267-293, June 1996.
    • (1996) EATCS Bull , vol.59 , pp. 267-293
    • Smith, E.1


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