On timed models and full abstraction

zbMATH Open1273.68262MaRDI QIDQ2852365FDOQ2852365

Authors: Gavin Lowe, Joël Ouaknine 

Publication date: 8 October 2013

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

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

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)

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
• Timed Abstract Dialectical Frameworks: A Simple Translation-Based Approach
• Predicate abstraction for dense real-time systems
• 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
• An Implementation Relation for Cyclic Systems with Refusals and Discrete Time
• Title not available (Why is that?)
• 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)