| 書目名稱 | CONCUR 2000 - Concurrency Theory | | 副標(biāo)題 | 11th International C | | 編輯 | Catuscia Palamidessi | | 視頻video | http://file.papertrans.cn/221/220444/220444.mp4 | | 概述 | Includes supplementary material: | | 叢書名稱 | Lecture Notes in Computer Science | | 圖書封面 |  | | 描述 | This volume contains the proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000) held in State College, Pennsylvania, USA, during 22-25 August 2000. The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency and promote its applications. Interest in this topic is continuously growing, as a consequence of the importance and ubiquity of concurrent systems and their - plications, and of the scienti?c relevance of their foundations. The scope covers all areas of semantics, logics, and veri?cation techniques for concurrent systems. Topics include concurrency related aspects of: models of computation, semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model-checking, veri?cation techniques, re?nement te- niques, term and graph rewriting, distributed programming, logic constraint p- gramming, object-oriented programming, typing systems and algorithms, case studies, tools, and environments for programming and veri?cation. The ?rst two CONCUR conferences were held in Amsterdam (NL) in 1990 and 1991. The following one | | 出版日期 | Conference proceedings 2000 | | 關(guān)鍵詞 | Algorithms; Constraint; algorithm; distributed programming; logic; model checking; petri net; programming; r | | 版次 | 1 | | doi | https://doi.org/10.1007/3-540-44618-4 | | isbn_softcover | 978-3-540-67897-7 | | isbn_ebook | 978-3-540-44618-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag Berlin Heidelberg 2000 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-11 08:03
發(fā)表于 2025-3-21 18:32:10
