Understanding concurrent systems

DOI10.1007/978-1-84882-258-0zbMath1211.68205OpenAlexW2128510433MaRDI QIDQ2269718

Publication date: 10 March 2010

Published in: Texts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-84882-258-0

zbMATH Keywords

software concurrent programming FDR communicating sequential processes programming techniques models of concurrent systems

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

Sound reasoning in \textit{tock}-CSP ⋮ A case study on parametric verification of failure detectors ⋮ Testing using CSP Models: Time, Inputs, and Outputs ⋮ Compositional Modelling and Reasoning in an Institution for Processes and Data ⋮ Tracking CSP computations ⋮ Process Algebra and Model Checking ⋮ Modelling timed reactive systems from natural-language requirements ⋮ Behavioural Models for FMI Co-simulations ⋮ Rigorous development of component-based systems using component metadata and patterns ⋮ Temporal reasoning through automatic translation of tock-CSP into timed automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ All congruences below stability-preserving fair testing or CFFD ⋮ Translating between models of concurrency ⋮ A Unary Semigroup Trace Algebra ⋮ Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving ⋮ Revisiting sequential composition in process calculi ⋮ Checking opacity and durable opacity with FDR ⋮ Specifying termination in CSP ⋮ Semantics of dynamic hiding in mobile UTP-CSP ⋮ Checking noninterference in timed CSP ⋮ Removing redundant refusals: minimal complete test suites for failure trace semantics ⋮ Correct and efficient antichain algorithms for refinement checking ⋮ SAT-solving in CSP trace refinement ⋮ Refinement checking for privacy policies ⋮ Compositional and local livelock analysis for CSP ⋮ Models for CSP with availability information ⋮ A Stepwise Approach to Linking Theories ⋮ The symbiosis of concurrency and verification: teaching and case studies ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unique solutions of contractions, CCS, and their HOL formalisation ⋮ Test selection for traces refinement ⋮ Associative composition of components with double-sided interfaces ⋮ The Automatic Detection of Token Structures and Invariants Using SAT Checking ⋮ Multi-parameterised compositional verification of safety properties ⋮ RiskStructures: a design algebra for risk-aware machines ⋮ Denotational semantics of channel mobility in UTP-CSP ⋮ Reducing complex CSP models to traces via priority ⋮ Computing maximal weak and other bisimulations ⋮ Complete model-based equivalence class testing for nondeterministic systems ⋮ Angelic processes for CSP via the UTP ⋮ Enabling synchronous and asynchronous communications in CSP for SOC ⋮ Elucidating concurrent algorithms via layers of abstraction and reification ⋮ Safe abstractions of data encodings in formal security protocol models ⋮ View abstraction for systems with component identities ⋮ Mitigating Multi-target Attacks in Hash-Based Signatures ⋮ Towards `up to context' reasoning about higher-order processes ⋮ Unnamed Item ⋮ Equations, Contractions, and Unique Solutions ⋮ The expressiveness of CSP with priority ⋮ Angelicism in the Theory of Reactive Processes ⋮ Towards Algebraic Semantics of Circus Time ⋮ Static Livelock Analysis in CSP ⋮ Discovering and correcting a deadlock in a channel implementation ⋮ Slow Abstraction via Priority ⋮ On constructibility and unconstructibility of LTS operators from other LTS operators ⋮ The semantics and verification of timed service choreography