메뉴 건너뛰기




Volumn 356, Issue 3, 2006, Pages 374-386

On the ω-language expressive power of extended Petri nets

Author keywords

languages; (extended) Petri nets; Expressiveness

Indexed keywords

FORMAL LANGUAGES; MATHEMATICAL MODELS;

EID: 33748095154     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.02.008     Document Type: Article
Times cited : (12)

References (19)
  • 2
    • 35048857405 scopus 로고    scopus 로고
    • T. Ball, S. Chaki, S. Rajamani, Parameterized verification of multithreaded software libraries, in: Proc. Fifth Internat. Conf. on Tools and Algorithms for Construction and Analysis of Systems (TACAS 2001), Lecture Notes in Computer Science, Vol. 2031, 2001, pp. 158-173.
  • 3
    • 85027532325 scopus 로고    scopus 로고
    • G. Ciardo, Petri nets with marking-dependent arc multiplicity: properties and analysis, in: Proc. 15th Internat. Conf. on Applications and Theory of Petri Nets (ICATPN 94), Lecture Notes in Computer Science, Vol. 815, 1994, pp. 179-198.
  • 4
    • 84944400032 scopus 로고    scopus 로고
    • G. Delzanno, Automatic verification of parameterized cache coherence protocols, in: Proc. 12th Internat. Conf. on Computer Aided Verification (CAV 2000), Lecture Notes in Computer Science, Vol. 1855, 2000, pp. 53-68.
  • 5
    • 84888244602 scopus 로고    scopus 로고
    • G. Delzanno, J.-F. Raskin, L. Van Begin, Towards the automated verification of multithreaded Java programs, in: Proc. Internat. Conf. on Tools and Algorithms for Construction and Analysis of Systems (TACAS 2002), Lecture Notes in Computer Science, Vol. 2280, 2002, pp. 173-187.
  • 6
    • 84878552622 scopus 로고    scopus 로고
    • C. Dufourd, A. Finkel, P. Schnoebelen, Reset nets between decidability and undecidability, in: In Proc. 25th Internat. Colloq. on Automata, Languages, and Programming (ICALP'98), Lecture Notes in Computer Science, Vol. 1443, 1998, pp. 103-115.
  • 7
    • 84887436670 scopus 로고    scopus 로고
    • C. Dufourd, P. Jančar, P. Schnoebelen, Boundedness of reset P / T nets, in:Proceeding of ICALP'99 26th International Colloquium on Automata, Languages and Programming, Prague, Czech Republic, Lecture Notes in Computer Science, Vol. 1644, 1999, pp. 301-310.
  • 8
    • 85007553476 scopus 로고    scopus 로고
    • E.A. Emerson, K.S. Namjoshi, On model checking for non-deterministic infinite-state systems, in: Proc. 13th Ann. Symp. on Logic in Computer Science (LICS '98), 1998, pp. 70-80.
  • 9
    • 0032597490 scopus 로고    scopus 로고
    • J. Esparza, A. Finkel, R. Mayr, On the verification of broadcast protocols, in: Proc. 14th Ann. Symp. on Logic in Computer Science (LICS'99), 1999, pp. 352-359.
  • 10
    • 0025628292 scopus 로고
    • Reduction and covering of infinite reachability trees
    • Finkel A. Reduction and covering of infinite reachability trees. Inform. and Comput. 89 (1990) 144-179
    • (1990) Inform. and Comput. , vol.89 , pp. 144-179
    • Finkel, A.1
  • 11
    • 84959187813 scopus 로고    scopus 로고
    • * for 2-dim Reset Transfer VASS, in: Proceedings of MFCS'2000: 25th Internation. Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovakia, Lecture Notes in Computer Science, Vol. 1893, 2000, pp. 353-362.
  • 12
    • 84944068512 scopus 로고    scopus 로고
    • A. Finkel, G. Sutre, Decidability of reachability problems for classes of two counters automata, in: Proceedings of STACS'2000:17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, Lecture Notes in Computer Science, Vol. 1770, 2000, pp. 346-357.
  • 13
    • 0026884434 scopus 로고
    • Reasoning about systems with many processes
    • German S.M., and Sistla A.P. Reasoning about systems with many processes. J. ACM 39 (1992) 675-735
    • (1992) J. ACM , vol.39 , pp. 675-735
    • German, S.M.1    Sistla, A.P.2
  • 14
    • 0003666511 scopus 로고
    • Academic Press Professional, Inc., New York
    • Handy J. The Cache Memory Book (1993), Academic Press Professional, Inc., New York
    • (1993) The Cache Memory Book
    • Handy, J.1
  • 16
    • 33748119040 scopus 로고    scopus 로고
    • J.-F. Raskin, L. Van Begin, Petri nets with non-blocking arcs are difficult to analyse, in: Proc. Fifth Internat. Workshop on Verification of Infinite-state Systems (INFINITY 2003), ENTCS, Vol. 96, 2003.
  • 17
    • 33748114250 scopus 로고    scopus 로고
    • G. Sutre, Abstraction et accélération de systèmes infinis, Ph.D. Thesis, École Normale Supérieure de Cachan, 2000.
  • 18
    • 33748101159 scopus 로고    scopus 로고
    • W. Thomas, Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, MIT Press, Cambridge, 1990, pp. 133-191.
  • 19
    • 33748106418 scopus 로고    scopus 로고
    • L. Van Begin, Efficient verification of counting abstractions for parametric systems, Ph.D. Thesis, Université Libre de Bruxelles, Belgium, 2003.


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