Failure trace semantics for a process algebra with time-outs

MaRDI QIDQ4989406zbMATH OpenFDO

Authors Rob van Glabbeek

Publication date 25 May 2021

Full work available at URL https://arxiv.org/abs/2002.10814, https://lmcs.episciences.org/7398

zbMATH Keywords

absolute expressivenessbranching timeCCSPconcurrencyfailure trace semanticsfull abstraction, safety propertieslabelled transition systemslinear timemay testingpriorityprocess algebrasemantic equivalencestime-outs

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• A process algebra for timed systems
• Reactive bisimulation semantics for a process algebra with timeouts
• The algebra of timed processes, ATP: Theory and application
• scientific article; zbMATH DE number 4011913
• scientific article; zbMATH DE number 140239

Cites work

• A brief history of Timed CSP
• A Theory of Communicating Sequential Processes
• A theory of encodings and expressiveness (extended abstract)
• An operational semantics for timed CSP
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Ensuring liveness properties of distributed systems: open problems
• Expressiveness of process algebras
• scientific article; zbMATH DE number 4037225 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 1142329 (Why is no real title available?)
• scientific article; zbMATH DE number 7559462 (Why is no real title available?)
• Lean and full congruence formats for recursion
• On Specifying Timeouts
• Process Algebra
• Proving the Correctness of Multiprocess Programs
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• Specification-oriented semantics for communicating processes
• Structured operational semantics and bisimulation as a congruence
• Testing equivalences for processes
• The coarsest precongruences respecting safety and liveness properties
• The difference between splitting in \(n\) and \(n+1\)
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• The timed failures -- Stability model for CSP
• Towards a unified approach to encodability and separation results for process calculi

Cited in

(7)

• Reactive bisimulation semantics for a process algebra with timeouts
• scientific article; zbMATH DE number 4011913 (Why is no real title available?)
• Trace- and failure-based semantics for responsiveness
• Discovering ePassport vulnerabilities using bisimilarity
• When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
• Modelling mutual exclusion in a process algebra with time-outs
• Branching bisimilarity for processes with time-outs

This page was built for publication: Failure trace semantics for a process algebra with time-outs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989406)