메뉴 건너뛰기




Volumn , Issue , 2002, Pages 119-124

Equivalence of timed state machines and safe TPN

Author keywords

automatic model translation; Time Petri Nets; Timed Automata; verification

Indexed keywords

AUTOMATA THEORY; PETRI NETS; VERIFICATION;

EID: 26444467115     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WODES.2002.1167678     Document Type: Conference Paper
Times cited : (14)

References (18)
  • 2
    • 0026120365 scopus 로고
    • Modeling and verification of time dependent systems using time petri nets
    • B. Berthomieu, and M. Diaz.Modeling and Verification of Time Dependent Systems Using Time Petri Nets. IEEE Transactions on Software Engineering 17(3):259-273, 1991.
    • (1991) IEEE Transactions on Software Engineering , vol.17 , Issue.3 , pp. 259-273
    • Berthomieu, B.1    Diaz, M.2
  • 3
    • 0020904451 scopus 로고
    • An enumerative approach for analyzing time petri nets
    • B. Berthomieu and M. Menasche. An Enumerative Approach for analyzing time Petri nets. Proceedings IFIP 1983.
    • (1983) Proceedings IFIP
    • Berthomieu, B.1    Menasche, M.2
  • 4
    • 18144404254 scopus 로고    scopus 로고
    • Non-equivalence between time petri nets and time stream petri nets
    • P. Buchholz and M. Silva (eds.) IEEE Comp. Soc
    • M. Boyer, M. Diaz. Non-Equivalence between Time Petri Nets and Time Stream Petri Nets. In: P. Buchholz and M. Silva (eds.), PNPM 1999:198-207, IEEE Comp. Soc.
    • (1999) PNPM , pp. 198-207
    • Boyer, M.1    Diaz, M.2
  • 5
    • 85117698197 scopus 로고    scopus 로고
    • Multiple enabledness of transitions in Petri nets with time
    • M. Boyer and M. Diaz. Multiple enabledness of transitions in Petri nets with time. Proceedings PNPM'01:219-228.
    • Proceedings PNPM'01 , pp. 219-228
    • Boyer, M.1    Diaz, M.2
  • 6
    • 0346397851 scopus 로고    scopus 로고
    • Time-based expressivity of time Petri nets for system specification
    • A. Cerone and A. Maggiolo Schettini. Time-based expressivity of time Petri nets for system specification. Theoretical Computer Science 216:1-53, 1999.
    • (1999) Theoretical Computer Science , vol.216 , pp. 1-53
    • Cerone, A.1    Maggiolo Schettini, A.2
  • 8
    • 36448975153 scopus 로고    scopus 로고
    • Une méthode de vérification d'intero-pérabilité temporelle
    • L. Kaiser. Une méthode de vérification d'intero-pérabilité temporelle. RENPAR 1997:207-210.
    • (1997) RENPAR , pp. 207-210
    • Kaiser, L.1
  • 9
    • 84936808951 scopus 로고    scopus 로고
    • Adaptive Timed Test for Temporal Interoperability Verification
    • Sept.
    • L. Kaiser and F. Simonot-Lion. Adaptive Timed Test for Temporal Interoperability Verification. Proceedings WFCS 2000, Porto, Sept. 2000.
    • (2000) Proceedings WFCS 2000 Porto
    • Kaiser, L.1    Simonot-Lion, F.2
  • 13
    • 0005865314 scopus 로고    scopus 로고
    • A causal semantics for time petri nets
    • J. Lilius. A causal semantics for time Petri nets. Theoretical Computer Science 243:409-447, 2000.
    • (2000) Theoretical Computer Science , vol.243 , pp. 409-447
    • Lilius, J.1
  • 14
    • 23044528835 scopus 로고    scopus 로고
    • Axiomatizing timed automata
    • H. Lin, W. Yi. Axiomatizing timed automata. Acta Informatica 38:277-305, 2002.
    • (2002) Acta Informatica , vol.38 , pp. 277-305
    • Lin, H.1    Yi, W.2
  • 16
    • 84936769704 scopus 로고    scopus 로고
    • Méthode formelle de génération de séquences de tests temporis és
    • F. Simonot-Lion, L. Kaiser, R. dos Santos Marques. Méthode formelle de génération de séquences de tests temporis és. MSR 2001:291-306.
    • (2001) MSR , pp. 291-306
    • Simonot-Lion, F.1    Kaiser, L.2    Dos Santos Marques, R.3
  • 18
    • 85027594526 scopus 로고
    • Real time behaviour of asynchronous agents. Concur
    • W. Yi. Real Time Behaviour of Asynchronous Agents. CONCUR 1990, LNCS 458:502-520.
    • (1990) LNCS , vol.458 , pp. 502-520
    • Yi, W.1


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