A Context-Free Process as a Pushdown Automaton
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On the Expressive Power of Process Interruption and Compensation
Web Services and Formal Methods
Action abstraction in timed process algebra: the case for an untimed silent step
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
On Rule Formats for Zero and Unit Elements
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of context-dependent channel-based service models
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Suitability of mCRL2 for concurrent-system design: a 2 × 2 switch case study
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Experiences in developing the mCRL2 toolset
Software—Practice & Experience
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
A language for behavioural modelling of architectural patterns
Proceedings of the Third Workshop on Behavioural Modelling
Proceedings of the Third Workshop on Behavioural Modelling
Rule formats for distributivity
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Transforming SOS specifications to linear processes
FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
PREG axiomatizer: a ground bisimilarity checker for GSOS with predicates
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
A process-theoretic look at automata
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
The equational theory of weak complete simulation semantics over BCCSP
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Decompositional reasoning about the history of parallel processes
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Analysing the control software of the compact muon solenoid experiment at the large hadron collider
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Using Model Checking to Analyze the System Behavior of the LHC Production Grid
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Formalizing a domain specific language using SOS: an industrial case study
SLE'11 Proceedings of the 4th international conference on Software Language Engineering
Formal Analysis of SystemC Designs in Process Algebra
Fundamenta Informaticae
Algebraic synchronization trees and processes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Partially-Supervised plants: embedding control requirements in plant components
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Interpreted systems semantics for process algebra with identity annotations
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Implementing generalized alternative construct for erasmus language
Proceedings of the 16th International ACM Sigsoft symposium on Component-based software engineering
Reliable supervisory coordination of stochastic communicating processes with data
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Using model checking to analyze the system behavior of the LHC production grid
Future Generation Computer Systems
Information and Computation
Generic models of the laws of programming
Theories of Programming and Formal Methods
Hi-index | 0.00 |
Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. It assembles the relevant results of most process algebras currently in use, and presents them in a unified framework and notation. The authors describe the theory underlying the development, realization and maintenance of software that occurs in parallel or distributed systems. A system can be specified in the syntax provided, and the axioms can be used to verify that a composed system has the required external behavior. As examples, two protocols are completely specified and verified in the text: the Alternating-Bit Protocol for Data Communication, and Fischer's Protocol of Mutual Exclusion. The book serves as a reference text for researchers and graduate students in computer science, offering a complete overview of the field and referring to further literature where appropriate.