On timed models and full abstraction

MaRDI QIDQ2852365zbMATH OpenFDO

Authors Gavin Lowe, Joël Ouaknine

Publication date 8 October 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066106002076

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The timed failures -- Stability model for CSP
• A timed model for communicating sequential processes
• A branching time model of CSP
• An operational semantics for timed CSP
• Probabilistic and prioritized models of timed CSP

Cited in

(16)

• Testing using CSP Models: Time, Inputs, and Outputs
• A Unary Semigroup Trace Algebra
• A branching time model of CSP
• Sound reasoning in \textit{tock}-CSP
• Three Approaches to Timed External Choice in UTP
• Checking noninterference in timed CSP
• On Abstractions for Timing Analysis in the $\mathbb{K}$ Framework
• Predicate abstraction for dense real-time systems
• Timed Abstract Dialectical Frameworks: A Simple Translation-Based Approach
• Models for CSP with availability information
• Towards Algebraic Semantics of Circus Time
• Better abstractions for timed automata
• Modeling and verifying time sensitive security protocols with constraints
• scientific article; zbMATH DE number 2182596 (Why is no real title available?)
• An Implementation Relation for Cyclic Systems with Refusals and Discrete Time
• Models for CSP with availability information

This page was built for publication: On timed models and full abstraction

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