This book constitutes the refereed proceedings of the 13th International Conference on Concurrency Theory, CONCUR 2002, held in Brno, Czech Republic in August 2002.The 32 revised full papers presented together with abstracts of seven invited contributions were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections on verification and model checking, logic, mobility, probabilistic systems, models of computation and process algebra, security, Petri nets, and bisimulation.
This book constitutes the refereed proceedings of the 15th International Conference on Concurrency Theory, CONCUR 2004, held in London, UK in August/September 2004. The 29 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 134 submissions. Among the topics covered are concurrency related aspects of models of computation, semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model checking, verification techniques, refinement, term and graph rewriting, distributed programming, constraint logic programming, object-oriented programming, typing systems and algorithms, case studies, tools, and environments for programming and verification.
This book constitutes the refereed proceedings of the 14th International Conference on Concurrency Theory, CONCUR 2003, held in Marseille, France in September 2003. The 29 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 107 submissions. The papers are organized in topical sections on partial orders and asynchronous systems, process algebras, games, infinite systems, probabilistic automata, model checking, model checking and HMSC, security, mobility, compositional methods and real time, and probabilistic models.
This book constitutes the refereed proceedings of the 19th International Conference on Concurrency Theory, CONCUR 2008, held in Toronto, Canada, August 19-22, 2008. The 33 revised full papers presented together with 2 tool papers were carefully reviewed and selected from 120 submissions. The topics include model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages.
This book studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems. It provides a unifying theory of communicating automata and their logical properties. Based on Hanf's Theorem and Thomas's graph acceptors, it develops a result that allows characterization of many popular models of distributed computation in terms of the existential fragment of monadic second-order logic.
This book constitutes the refereed proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, MFCS 2003, held in Bratislava, Slovakia in August 2003. The 55 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 137 submissions. All current aspects in theoretical computer science are addressed, ranging from discrete mathematics, combinatorial optimization, graph theory, networking, algorithms, and complexity to programming theory, formal methods, and mathematical logic.
This book constitutes the thoroughly refereed post-proceedings of the IST/FET International Workshop on Global Computing, GC 2004, held in Rovereto, Italy in March 2004. The 18 revised full papers presented were carefully selected during two rounds of reviewing and improvement from numerous submissions. Among the topics covered are programming environments, dynamic reconfiguration, resource guarantees, peer-to-peer networks, analysis of systems and resources, resource sharing, and security, as well as foundational calculi for mobility.
This volume contains the proceedings of FORTE 2003, the 23rd IFIP TC 6/ WG 6.1 International Conference on Formal Techniques for Networked and D- tributed Systems, held in Berlin, Germany, September 29–October 2, 2003. FORTE denotes a series of international working conferences on formal descr- tion techniques (FDTs) applied to computer networks and distributed systems. The conference series started in 1981 under the name PSTV. In 1988 a s- ond series under the name FORTE was set up. Both series were united to FORTE/PSTV in 1996. Two years ago the conference name was changed to its current form. The last ?ve meetings of this long conference series were held in Paris, France (1998), Beijing, China (1999), Pisa, Italy (2000), Cheju Island, Korea (2001), and Houston, USA (2002). The 23rd FORTE conference was especially dedicated to the application of formal description techniques to practice, especially in the Internet and c- munication domain. The scope of the papers presented at FORTE 2003 covered the application of formal techniques, timed automata, FDT-based design, v- i?cation and testing of communication systems and distributed systems, and the veri?cation of security protocols. In addition, work-in-progress papers were presented which have been published in a separate volume.
This book constitutes the thoroughly refereed post-conference proceedings of the 7th International Haifa Verification Conference, HVC 2011, held in Haifa, Israel in December 2011. The 15 revised full papers presented together with 3 tool papers and 4 posters were carefully reviewed and selected from 43 submissions. The papers are organized in topical sections on synthesis, formal verification, software quality, testing and coverage, experience and tools, and posters- student event.
ICGT 2002 was the ?rst International Conference on Graph Transformation following a series of six international workshops on graph grammars with - plications in computer science, held in Bad Honnef (1978), Osnabruc ̈ k (1982), Warrenton (1986), Bremen (1990), Williamsburg (1994), and Paderborn (1998). ICGT 2002 was held in Barcelona (Spain), October 7–12, 2002 under the a- pices of the European Association of Theoretical Computer Science (EATCS), the European Association of Software Science and Technology (EASST), and the IFIP Working Group 1.3, Foundations of Systems Speci?cation. The scope of the conference concerned graphical structures of various kinds (like graphs, diagrams, visual sentences and others) that are useful to describe complex structures and systems in a direct and intuitive way. These structures are often augmented by formalisms which add to the static description a further dimension, allowing for the modeling of the evolution of systems via all kinds of transformations of such graphical structures. The ?eld of Graph Transformation is concerned with the theory, applications, and implementation issues of such formalisms. The theory is strongly related to areas such as graph theory and graph - gorithms, formal language and parsing theory, the theory of concurrent and distributed systems, formal speci?cation and veri?cation, logic, and semantics.
