Process Algebra: Equational Theories of Communicating Processes


Book Description

Presents a unified overview of the various process algebras currently in use and sets the standard for the field.




Process Algebra


Book Description




A Journey from Process Algebra via Timed Automata to Model Learning


Book Description

This Festschrift, dedicated to Frits W. Vaandrager on the occasion of his 60th birthday, contains papers written by many of his closest collaborators. Frits has been a Professor of Informatics for Technical Applications at Radboud University Nijmegen since 1995, where his research focuses on formal methods, concurrency theory, verification, model checking, and automata learning. The volume contains contributions of colleagues, Ph.D. students, and researchers with whom Frits has collaborated and inspired, reflecting a wide spectrum of scientific interests, and demonstrating successful work at the highest levels of both theory and practice.




Modeling Time in Computing


Book Description

Models that include a notion of time are ubiquitous in disciplines such as the natural sciences, engineering, philosophy, and linguistics, but in computing the abstractions provided by the traditional models are problematic and the discipline has spawned many novel models. This book is a systematic thorough presentation of the results of several decades of research on developing, analyzing, and applying time models to computing and engineering. After an opening motivation introducing the topics, structure and goals, the authors introduce the notions of formalism and model in general terms along with some of their fundamental classification criteria. In doing so they present the fundamentals of propositional and predicate logic, and essential issues that arise when modeling time across all types of system. Part I is a summary of the models that are traditional in engineering and the natural sciences, including fundamental computer science: dynamical systems and control theory; hardware design; and software algorithmic and complexity analysis. Part II covers advanced and specialized formalisms dealing with time modeling in heterogeneous software-intensive systems: formalisms that share finite state machines as common “ancestors”; Petri nets in many variants; notations based on mathematical logic, such as temporal logic; process algebras; and “dual-language approaches” combining two notations with different characteristics to model and verify complex systems, e.g., model-checking frameworks. Finally, the book concludes with summarizing remarks and hints towards future developments and open challenges. The presentation uses a rigorous, yet not overly technical, style, appropriate for readers with heterogeneous backgrounds, and each chapter is supplemented with detailed bibliographic remarks and carefully chosen exercises of varying difficulty and scope. The book is aimed at graduate students and researchers in computer science, while researchers and practitioners in other scientific and engineering disciplines interested in time modeling with a computational flavor will also find the book of value, and the comparative and conceptual approach makes this a valuable introduction for non-experts. The authors assume a basic knowledge of calculus, probability theory, algorithms, and programming, while a more advanced knowledge of automata, formal languages, and mathematical logic is useful.




SOFSEM 2013: Theory and Practice of Computer Science


Book Description

This book constitutes the refereed proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2013, held in Špindlerův Mlýn, Czech Republic, in January 2013. The 37 revised full papers presented in this volume were carefully reviewed and selected from 98 submissions. The book also contains 10 invited talks, 5 of which are in full-paper length. The contributions are organized in topical sections named: foundations of computer science; software and Web engineering; data, information, and knowledge engineering; and social computing and human factors.




CONCUR 2008 - Concurrency Theory


Book Description

This volume contains the proceedings of the 19th International Conference on Concurrency Theory (CONCUR 2008) which took place at the University of TorontoinToronto,Canada,August19–22,2008. CONCUR2008wasco-located with the 27th Annual ACM SIGACT-SIGOPS Symposium on the Principles of Distributed Computing (PODC 2008), and the two conferences shared two invited speakers, some social events, and a symposium celebrating the lifelong research contributions of Nancy Lynch. 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 applications, and of the scienti?c relevance of their foundations. Topics include basic models of concurrency (such as abstract machines, domain theoretic m- els, game theoretic models, process algebras, and Petri nets), logics for c- currency (such as modal logics, temporal logics and resource logics), models of specialized systems (such as biology-inspired systems, circuits, hybrid systems, mobile systems, multi-core processors, probabilistic systems, real-time systems, synchronoussystems, and Web services),veri?cationand analysis techniques for concurrent systems (such as abstract interpretation, atomicity checking, mod- checking, race detection, run-time veri?cation, state-space exploration, static analysis,synthesis,testing, theorem provingand type systems), andrelated p- gramming models (such as distributed or object-oriented). Of the 120 regular and 5 tool papers submitted this year, 33 regular and 2 tool papers were accepted for presentation and areincluded in the present v- ume.




Language and Automata Theory and Applications


Book Description

This book constitutes the refereed proceedings of the 5th International Conference on Language and Automata Theory and Applications, LATA 2011, held in Tarragona, Spain in May 2011. The 36 revised full papers presented together with four invited articles were carefully selected from 91 submissions. Among the topics covered are algebraic language theory, automata and logic, systems analysis, systems verifications, computational complexity, decidability, unification, graph transformations, language-based cryptography, and applications in data mining, computational learning, and pattern recognition.




Algebra and Coalgebra in Computer Science


Book Description

This book constitutes the refereed proceedings of the 5th International Conference on Algebra and Coalgebra in Computer Science, CALCO 2013, held in Warsaw, Poland, in September 2013. The 18 full papers presented together with 4 invited talks were carefully reviewed and selected from 33 submissions. The papers cover topics in the fields of abstract models and logics, specialized models and calculi, algebraic and coalgebraic semantics, system specification and verification, as well as corecursion in programming languages, and algebra and coalgebra in quantum computing. The book also includes 6 papers from the CALCO Tools Workshop, co-located with CALCO 2013 and dedicated to tools based on algebraic and/or coalgebraic principles.




Paradigms of Concurrency


Book Description

Paradigms of Concurrency: Observations, Behaviours, and Systems - a Petri Net View - Ryszard Janicki (McMaster University, CA) Jetty Kleijn (Leiden University, NL) Maciej Koutny (Newcastle University, UK) Lukasz Mikulski (Nicolaus Copernicus University, PL) Concurrency can be studied at different yet consistent levels of abstraction: from individual behavioural observations via more abstract concurrent histories that can be represented by causality structures capturing invariant dependencies between executed actions, to system level constructs such as Petri nets or process algebra expressions. Histories can then be understood as sets of closely related observations. Depending on the nature of the observed relationships between executed actions involved in a single concurrent history, one may identify different concurrency paradigms underpinned by different kinds of causality structures such as partial orders. This book studies fundamental mathematical abstractions to capture and relate observations, histories, and systems. In particular, taking a Petri net view, we present system models fitting various concurrency paradigms and their associated causality structures.




The Mathematical Theory of Communication


Book Description

Scientific knowledge grows at a phenomenal pace--but few books have had as lasting an impact or played as important a role in our modern world as The Mathematical Theory of Communication, published originally as a paper on communication theory more than fifty years ago. Republished in book form shortly thereafter, it has since gone through four hardcover and sixteen paperback printings. It is a revolutionary work, astounding in its foresight and contemporaneity. The University of Illinois Press is pleased and honored to issue this commemorative reprinting of a classic.