scientific article; zbMATH DE number 7350777
From MaRDI portal
Publication:4989406
Publication date: 25 May 2021
Full work available at URL: https://arxiv.org/abs/2002.10814
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
process algebrapriorityconcurrencylinear timelabelled transition systemsbranching timesemantic equivalencesmay testingabsolute expressivenessCCSPfailure trace semanticsfull abstraction, safety propertiestime-outs
Related Items (4)
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 ⋮ Reactive bisimulation semantics for a process algebra with timeouts ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A brief history of Timed CSP
- Specification-oriented semantics for communicating processes
- Structured operational semantics and bisimulation as a congruence
- The timed failures -- Stability model for CSP
- Testing equivalences for processes
- The difference between splitting in \(n\) and \(n+1\)
- A theory of encodings and expressiveness (extended abstract)
- An operational semantics for timed CSP
- Towards a unified approach to encodability and separation results for process calculi
- Ensuring liveness properties of distributed systems: open problems
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- Expressiveness of Process Algebras
- The Coarsest Precongruences Respecting Safety and Liveness Properties
- Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
- A Theory of Communicating Sequential Processes
- Process Algebra
- Proving the Correctness of Multiprocess Programs
- On Specifying Timeouts
This page was built for publication:
