Applications of Process Algebra

Applications of Process Algebra PDF

Author: J. C. M. Baeten

Publisher: Cambridge University Press

Published: 2005-02-17

Total Pages: 332

ISBN-13: 9780521607506

DOWNLOAD EBOOK →

This book gives applications of the theory of process algebra, or Algebra of Communicating Processes (ACP), that is the study of concurrent or communicating processes studied using an algebraic framework. The approach is axiomatic; the authors consider structures that are some set of mostly equational axioms, which are equipped with several operators. Thus the term 'algebra' is used in the model-theoretic sense. The axiomatic approach enables one to organize the field of process theories. The theory is applied systematically to a number of situations, including systolic algorithms, semantics of an object-oriented language, and protocols. It will be welcomed by computer scientists working in parallel programming.

A Journey from Process Algebra via Timed Automata to Model Learning

A Journey from Process Algebra via Timed Automata to Model Learning PDF

Author: Nils Jansen

Publisher: Springer Nature

Published: 2022-09-06

Total Pages: 593

ISBN-13: 3031156293

DOWNLOAD EBOOK →

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

Modeling Time in Computing PDF

Author: Carlo A. Furia

Publisher: Springer Science & Business Media

Published: 2012-10-19

Total Pages: 430

ISBN-13: 3642323316

DOWNLOAD EBOOK →

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

SOFSEM 2013: Theory and Practice of Computer Science PDF

Author: Peter van Emde Boas

Publisher: Springer

Published: 2013-01-12

Total Pages: 579

ISBN-13: 3642358438

DOWNLOAD EBOOK →

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

CONCUR 2008 - Concurrency Theory PDF

Author: Franck van Breugel

Publisher: Springer

Published: 2008-08-19

Total Pages: 537

ISBN-13: 3540853618

DOWNLOAD EBOOK →

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

Language and Automata Theory and Applications PDF

Author: Adrian-Horia Dediu

Publisher: Springer

Published: 2011-05-27

Total Pages: 524

ISBN-13: 3642212549

DOWNLOAD EBOOK →

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 of Communicating Processes

Algebra of Communicating Processes PDF

Author: Alban Ponse

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 369

ISBN-13: 1447121201

DOWNLOAD EBOOK →

ACP, the Algebra of Communicating Processes, is an algebraic approach to the study of concurrent processes, initiated by Jan Bergstra and Jan Will em Klop in the early eighties. These proceedings comprise the contributions to ACP94, the first workshop devoted to ACP. The work shop was held at Utrecht University, 16-17 May 1994. These proceedings are meant to provide an overview of current research in the area of ACP. They contain fifteen contributions. The first one is a classical paper on ACP by J.A. Bergstra and J.W. Klop: The Algebra of Recursively Defined Processes and the Algebra of Regular Processes, Report IW 235/83, Mathematical Centre, Amsterdam, 1983. It serves as an introduction to the remainder of the proceedings and, indeed, as a general introduction to ACP. An extended abstract of this paper is published under the same title in the ICALP' 84 proceedings. Of the re maining contributions, three were submitted by the invited speakers and the others were selected by the programme committee. As for the presentations, Jos Baeten, Rob van Glabbeek, Jan Friso Groote, and Frits Vaandrager were each invited to deliver a lecture. A paper relating to Frits Vaandrager's lecture has already been submitted for publication elsewhere and is not, therefore, included in these pro ceedings. Gabriel Ciobanu, one of our guests, gave an impression of his work in an extra lecture. Furthermore, ten presentations were given on the basis of selected papers.

Process Algebras for Petri Nets

Process Algebras for Petri Nets PDF

Author: Roberto Gorrieri

Publisher: Springer

Published: 2017-04-13

Total Pages: 302

ISBN-13: 3319555596

DOWNLOAD EBOOK →

This book deals with the problem of finding suitable languages that can represent specific classes of Petri nets, the most studied and widely accepted model for distributed systems. Hence, the contribution of this book amounts to the alphabetization of some classes of distributed systems. The book also suggests the need for a generalization of Turing computability theory. It is important for graduate students and researchers engaged with the concurrent semantics of distributed communicating systems. The author assumes some prior knowledge of formal languages and theoretical computer science.