This book constitutes the refereed proceedings of the 20th International Conference on Concurrency Theory, CONCUR 2009, held in Bologna, Italy, September 1-4, 2009. The 37 revised full papers presented together with four invited papers were carefully reviewed and selected from 129 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 constitutes the refereed proceedings of the 22nd International Conference on Concurrency Theory, CONCUR 2011, held in Aachen, Germany, September 5-10, 2011. The 32 revised full papers were carefully reviewed and selected from 94 submissions. The papers are organized in topics such as real-time systems, probabilistic systems, automata, separation logic, π-calculus, Petri nets, process algebra and modeling, verification, games, and bisimulation.
This open access book constitutes the proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2023, which was held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, during April 22-27, 2023, in Paris, France. The 56 full papers and 6 short tool demonstration papers presented in this volume were carefully reviewed and selected from 169 submissions. The proceedings also contain 1 invited talk in full paper length, 13 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report. TACAS is a forum for researchers, developers, and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference aims to bridge the gaps between different communities with this common interest and to support them in their quest to improve the utility, reliability, flexibility, and efficiency of tools and algorithms for building computer-controlled systems.
This book constitutes the proceedings of the 13th International Conference, DLT 2009, held in Stuttgart, Germany from June 30 until July 3, 2009. The 35 papers presented together with 4 invited talks were carefully reviewed and selected from 70 submissions. The papers presented address topics on formal languages, automata theory, computability, complexity, logic, petri nets and related areas.
This book constitutes the thoroughly refereed proceedings of the 23rd International Conference on Concurrency Theory, CONCUR 2012, held in Newcastle upon Tyne, UK, September 4-7, 2012. The 35 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 97 submissions. The papers are organized in topics such as reachability analysis; qualitative and timed systems; behavioural equivalences; temporal logics; session types; abstraction; mobility and space in process algebras; stochastic systems; probabilistic systems; Petri nets and non-sequential semantics; verification; decidability.
The purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the “resources” by “profit” and then be interested in the maximal profit realized, correspondingly, by a given word.
Pervasive computing (also referred to as ubiquitous computing or ambient intelligence) aims to create environments where computers are invisibly and seamlessly integrated and connected into our everyday environment. Pervasive computing and intelligent multimedia technologies are becoming increasingly important, although many potential applications have not yet been fully realized. These key technologies are creating a multimedia revolution that will have significant impact across a wide spectrum of consumer, business, healthcare, and governmental domains. This useful volume provides up-to-date and state-of-the-art coverage of the diverse topics related to pervasive computing and intelligent multimedia technologies. The use of different computational intelligence-based approaches to various problems in pervasive computing are examined, including video streaming, intelligent behavior modeling and control for mobile manipulators, tele-gaming, indexing video summaries for quick video browsing, web service processes, virtual environments, ambient intelligence, and prevention and detection of attacks to ubiquitous databases. Topics and features: Includes a comprehensive overview, providing a thorough literature review and an outline of the important research challenges Discusses pervasive computing approaches in the context of intelligent multimedia Examines virtual reality technology, mobile virtual environments, and the potential use of intelligent multimedia and ubiquitous computing in the hotels of the future Describes various approaches in ambient intelligence for home health care for the elderly and those suffering from Alzheimer's disease, for volcano monitoring, and for preventing attacks to ubiquitous databases Investigates issues in web services and situation awareness in pervasive computing environments Explores wireless network applications, such as mobile agents and e-commerce This textbook/reference is an invaluable resource for researchers, postgraduate and senior undergraduate students, and practitioners involved in pervasive computing, intelligent multimedia, and computational intelligence.
Cyber-Physical Systems: Foundations, Principles and Applications explores the core system science perspective needed to design and build complex cyber-physical systems. Using Systems Science's underlying theories, such as probability theory, decision theory, game theory, organizational sociology, behavioral economics, and cognitive psychology, the book addresses foundational issues central across CPS applications, including System Design -- How to design CPS to be safe, secure, and resilient in rapidly evolving environments, System Verification -- How to develop effective metrics and methods to verify and certify large and complex CPS, Real-time Control and Adaptation -- How to achieve real-time dynamic control and behavior adaptation in a diverse environments, such as clouds and in network-challenged spaces, Manufacturing -- How to harness communication, computation, and control for developing new products, reducing product concepts to realizable designs, and producing integrated software-hardware systems at a pace far exceeding today's timeline. The book is part of the Intelligent Data-Centric Systems: Sensor-Collected Intelligence series edited by Fatos Xhafa, Technical University of Catalonia. Indexing: The books of this series are submitted to EI-Compendex and SCOPUS - Includes in-depth coverage of the latest models and theories that unify perspectives, expressing the interacting dynamics of the computational and physical components of a system in a dynamic environment - Focuses on new design, analysis, and verification tools that embody the scientific principles of CPS and incorporate measurement, dynamics, and control - Covers applications in numerous sectors, including agriculture, energy, transportation, building design and automation, healthcare, and manufacturing
This volume contains the proceedings of the 20th Conference on Concurrency Theory (CONCUR 2009), held in Bologna, September 1–4, 2009. The purpose of the CONCUR conference is to bring together researchers, developers, and s- dentsinordertoadvancethetheoryofconcurrencyandpromoteitsapplications. This year the CONCUR conference was in its 20th edition, and to celebrate 20 years of CONCUR, the conference program included a special session organized by the IFIP Working Groups 1.8 “Concurrency Theory” and 2.2 “Formal - scriptionofProgrammingConcepts”aswellas aninvitedlecturegivenby Robin Milner, one of the fathers of the concurrency theory research area. This edition of the conference attracted 129 submissions. We wish to thank all their authors for their interest in CONCUR 2009. After careful discussions, the Program Committee selected 37 papers for presentation at the conference. Each of them was accurately refereed by at least three reviewers (four reviewers for papers co-authored by members of the Program Committee), who delivered detailedandinsightfulcommentsandsuggestions.TheconferenceChairswarmly thank all the members of the Program Committee and all their sub-referees for the excellent support they gave, as well as for the friendly and constructive discussions. We would also like to thank the authors for having revised their papers to address the comments and suggestions by the referees. The conference program was enriched by the outstanding invited talks by Martin Abadi, Christel Baier, Corrado Priami and, as mentioned above, Robin Milner.
A graduate-level textbook that presents a unified mathematical framework for modeling and analyzing cyber-physical systems, with a strong focus on verification. Verification aims to establish whether a system meets a set of requirements. For such cyber-physical systems as driverless cars, autonomous spacecraft, and air-traffic management systems, verification is key to building safe systems with high levels of assurance. This graduate-level textbook presents a unified mathematical framework for modeling and analyzing cyber-physical systems, with a strong focus on verification. It distills the ideas and algorithms that have emerged from more than three decades of research and have led to the creation of industrial-scale modeling and verification techniques for cyber-physical systems.
