Inthe?eldofformalmethodsincomputerscience,concurrencytheoryisreceivinga constantlyincreasinginterest.Thisisespeciallytrueforprocessalgebra.Althoughit had been originally conceived as a means for reasoning about the semantics of c- current programs, process algebraic formalisms like CCS, CSP, ACP, ?-calculus, and their extensions (see, e.g., [154,119,112,22,155,181,30]) were soon used also for comprehendingfunctionaland nonfunctionalaspects of the behaviorof com- nicating concurrent systems. The scienti?c impact of process calculi and behavioral equivalences at the base of process algebra is witnessed not only by a very rich literature. It is in fact worth mentioningthe standardizationprocedurethat led to the developmentof the process algebraic language LOTOS [49], as well as the implementation of several modeling and analysis tools based on process algebra, like CWB [70] and CADP [93], some of which have been used in industrial case studies. Furthermore, process calculi and behavioral equivalencesare by now adopted in university-levelcourses to teach the foundations of concurrent programming as well as the model-driven design of concurrent, distributed, and mobile systems. Nevertheless, after 30 years since its introduction, process algebra is rarely adopted in the practice of software development. On the one hand, its technica- ties often obfuscate the way in which systems are modeled. As an example, if a process term comprises numerous occurrences of the parallel composition operator, it is hard to understand the communicationscheme among the varioussubterms. On the other hand, process algebra is perceived as being dif?cult to learn and use by practitioners, as it is not close enough to the way they think of software systems.

This book presents 8 tutorial lectures given by leading researchers at the 14th edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2014, held in Bertinoro, Italy, in June 2014.

SFM 2014 was devoted to executable software models and covered topics such as variability models, automated analysis techniques, deductive verification, and runtime assessment and testing. The papers collected in the two parts (first part: modeling and verification; second part: run-time assessment and testing) of this volume represent the broad range of topics of the school.

This book presents 11 tutorial lectures by leading researchers given at the 12th edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2012, held in Bertinoro, Italy, in June 2012. SFM 2012 was devoted to model-driven engineering and covered several topics including modeling languages; model transformations, functional and performance modeling and analysis; and model evolution management.

Inthe?eldofformalmethodsincomputerscience,concurrencytheoryisreceivinga constantlyincreasinginterest.Thisisespeciallytrueforprocessalgebra.Althoughit had been originally conceived as a means for reasoning about the semantics of c- current programs, process algebraic formalisms like CCS, CSP, ACP, ?-calculus, and their extensions (see, e.g., [154,119,112,22,155,181,30]) were soon used also for comprehendingfunctionaland nonfunctionalaspects of the behaviorof com- nicating concurrent systems. The scienti?c impact of process calculi and behavioral equivalences at the base of process algebra is witnessed not only by a very rich literature. It is in fact worth mentioningthe standardizationprocedurethat led to the developmentof the process algebraic language LOTOS [49], as well as the implementation of several modeling and analysis tools based on process algebra, like CWB [70] and CADP [93], some of which have been used in industrial case studies. Furthermore, process calculi and behavioral equivalencesare by now adopted in university-levelcourses to teach the foundations of concurrent programming as well as the model-driven design of concurrent, distributed, and mobile systems. Nevertheless, after 30 years since its introduction, process algebra is rarely adopted in the practice of software development. On the one hand, its technica- ties often obfuscate the way in which systems are modeled. As an example, if a process term comprises numerous occurrences of the parallel composition operator, it is hard to understand the communicationscheme among the varioussubterms. On the other hand, process algebra is perceived as being dif?cult to learn and use by practitioners, as it is not close enough to the way they think of software systems.

This volume presents the set of papers accompanying the lectures of the 9th International School on Formal Methods for the Design of Computer, Com- nication and Software Systems (SFM). Thisseriesofschoolsaddressestheuseofformalmethodsincomputerscience asaprominentapproachtotherigorousdesignofcomputer, communication, and software systems. The main aim of the SFM series is to o?er a good spectrum of current research in foundations as well as applications of formal methods, which can be of help for graduate students and young researchers who intend to approach the ?eld. SFM 2009 was devoted to formal methods for Web services and covered s- eral aspects including choreography, orchestration, description techniques, - teraction, synthesis, composition, session types, contracts, veri?cation, security, and performance. This volume comprises eight articles. Bruni's paper overviews some of the most recently proposed abstractions in the setting of process calculi tailored to the well-disciplined handling of issues such as long-running interactions, orch- tration, and unexpected events. Van der Aalst, Mooij, Stahl, and Wolf provide some foundational notions related to service interaction and address in a Petri net setting challenges like how to expose a service, how to replace and re?ne services, and how to generate service adapters. The paper by Marconi and - store presents a survey of existing approaches to the synthesis of Web service compositions, a di?cult and error-pronetask that requires automated solutions.

This volume presents the set of papers accompanying the lectures of the eighth International School on Formal Methods for the Design of Computer, Com- nication, and Software Systems (SFM). Thisseriesofschoolsaddressestheuseofformalmethodsincomputerscience asaprominentapproachtotherigorousdesignofcomputer, communication, and software systems. The main aim of the SFM series is to o?er a good spectrum of current research in foundations as well as applications of formal methods, which can be of help for graduate students and young researchers who intend to approach the ?eld. SFM 2008 was devoted to formal techniques for computational systems - ology and covered several aspects of the ?eld, including computational models, calculi and logics for biological systems, and veri?cation and simulation me- ods. Theschoolfeatured not onlyregularlectures, but also talksgivenby people involvedinthe ItalianresearchprojectonBio-InspiredSystems andCalculiwith Applications (BISCA). The ?rst partof this volume comprises nine papers basedon regularlectures. The paper by Degasperi and Gilmore describes the application of sensitivity analysistechniques to stochastic simulation algorithms. Talcott's paper presents pathway logic, an approach to modeling and analysis of biological processes based on rewriting logic. Fages and Soliman study reaction graphs and acti- tion/inhibition graphs used by biologists through formal methods originating from programming theory. The paper by Maus, John, R] ohl, and Uhrmacher d- cusses categories, abstraction hierarchies, and composition hierarchies playing a role in modeling and simulation for computational biology. Gillespie's paper - views the theory of stochastic chemical kinetics and several simulation methods that are based on that theory."

This book presents a set of 11 papers accompanying the lectures of leading researchers given at the 7th edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2007, held in Bertinoro, Italy in May/June 2007.

SFM 2007 was devoted to formal techniques for performance evaluation and coveres several aspects of the field, including formalisms for performance modeling (Markov chains, queueing networks, stochastic Petri nets, and stochastic process algebras), equivalence checking and model checking, efficient solution techniques, and software performance engineering.

This book presents 8 papers accompanying the lectures of leading researchers given at the 6th edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems (SFM 2006). SFM 2006 was devoted to formal techniques for hardware verification and covers several aspects of the hardware design process, including hardware design languages and simulation, property specification formalisms, automatic test pattern generation, symbolic trajectory evaluation, and more.

Thisvolumecollectsasetofpapersaccompanyingthelecturesofthe?fthedition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems (SFM). Thisseriesofschoolsaddressestheuseofformalmethodsincomputerscience asaprominentapproachtotherigorousdesignofcomputer, communication and software systems. The main aim of the SFM series is to o?er a good spectrum of current research in foundations as well as applications of formal methods, which can be of help for graduate students and young researchers who intend to approach the ?eld. SFM 2005 (Moby) was devoted to formal methods and tools for the design of mobile systems and mobile communication infrastructures. This volume is organized into four parts related to mobile computing, which cover models and languages, scalability and performance, dynamic power management, and m- dleware support. Each part is composed of two papers. The opening paper by Montanari and Pistore gives an overview of histo- dependent automata, an extension of ordinary automata that overcomes their limitations in dealing with named calculi. In particular, the authors show that history-dependent automata allow for a compact representation of?-calculus processes, which is suitable both for theoretical investigations and for the v- i?cation of models of agents and code mobility. Bettini and De Nicola's - per presents X-Klaim, an experimental programming language speci?cally - signed to develop distributed systems composed of several components intera- ing through multiple distributed tuple spaces and mobile code. Through a series of examples, the authors show that many mobile code programming paradigms can be naturally implemented by means of the considered language, which c- bines explicit localities as ?rst-class data with coordination primitives.

A large class of computing systems can be speci?ed and veri?ed by abstracting away from the temporal aspects of their behavior. Inreal-timesystems,instead, time issues become essential. Their correctness depends not only on which - tions they can perform, but also on the action execution time. Due to their importance and design challenges, real-time systems have attracted the att- tion of a considerable number of computer scientists and engineers from various research areas. This volume collects a set of papers accompanying the lectures of the fourth edition of theInternational School on Formal Methods for the Design of C- puter,Communication andSoftware Systems (SFM). The school addressed the use of formal methods in computer science as a prominent approach to the r- orous design of computer, communication and software systems. The main aim of the SFM series is to o?er a good spectrum of current research in foundations as well as applications of formal methods, which can be of help for graduate students and young researchers who intend to approach the ?eld. SFM-04:RT was devoted to real-time systems. It covered formal models and languagesforthespeci?cation,modeling,analysis,andveri? cationoftheseti- critical systems, the expressiveness of such models and languages, as well as supporting tools and related applications in di?erent domains.

In the past ten years or so, software architecture has emerged as a central notion in the development of complex software systems. Software architecture is now accepted in the software engineering research and development community as a manageable and meaningful abstraction of the system under development and is applied throughout the software development life cycle, from requirements analysis and validation, to design and down to code and execution level.

This book presents the tutorial lectures given by leading authorities at the Third International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2003, held in Bertinoro, Italy, in September 2003. The book is ideally suited for advanced courses on software architecture as well as for ongoing education of software engineers using formal methods in their day-to-day professional work.

This book presents 8 tutorial lectures given by leading researchers at the 16th edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2016, held in Bertinoro, Italy, in June 2016. SFM 2016 was devoted to the Quantitative Evaluation of Collective Adaptive Systems and covered topics such as self-organization in distributed systems, scalable quantitative analysis, spatio-temporal models, and aggregate programming.

This book presents 5 tutorial lectures given by leading researchers at the 15th edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2015, held in Bertinoro, Italy, in June 2015. SFM 2015 was devoted to multicore programming and covered topics such as concurrency and coordination mechanisms, architecture and memory models and type systems.

This book presents 5 tutorial lectures given by leading researchers at the 13th edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2013, held in Bertinoro, Italy, in June 2013. SFM 2013 was devoted to dynamical systems and covered several topics including chaotic dynamics; information theory; systems biology; hybrid systems; quantum computing; and automata-based models and model checking.

In this monograph, the author focuses on trace and testing semantics for nondeterministic and probabilistic processes represented by simple probabilistic automata. A trace is a sequence of activities labeling a sequence of transitions performed by a process, thus abstracting from branching points in the process behavior. A test is formalized as a nondeterministic and probabilistic process extended with success states or success actions, which is run in parallel with the process under test thus resulting in an interaction or testing system. Written as a comprehensive review of the topic, the author introduces the reader to the concept of nondeterministic and probabilistic models and how nondeterminism can be resolved. The author then considers probabilistic models, three anomalies of these models and how to overcome them. The author then addresses alternative characterizations of the two probabilistic trace equivalences. Finally, the author considers the anomalies of probabilistic testing equivalence and how to avoid them. This monograph is aimed at researchers working on the formal method aspects of programming languages.