Pages that link to "Item:Q1891147"

The following pages link to An operational semantics for timed CSP (Q1891147):

Displaying 23 items.

• Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
• Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
• A brief history of Timed CSP (Q674191) (← links)
• Probabilistic and prioritized models of timed CSP (Q674193) (← links)
• Denote CSP with temporal formulas (Q805250) (← links)
• A conservative look at operational semantics with variable binding (Q1273877) (← links)
• The timed failures -- Stability model for CSP (Q1274446) (← links)
• The connection between an event structure semantics and an operational semantics for TCSP (Q1323346) (← links)
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
• Timing and causality in process algebra (Q1924998) (← links)
• Sound reasoning in \textit{tock}-CSP (Q2120813) (← links)
• Translating between models of concurrency (Q2182666) (← links)
• Rule formats for timed processes (Q2841307) (← links)
• Timed CSP = closed timed automata (Q2842610) (← links)
• On timed models and full abstraction (Q2852365) (← links)
• The semantics and verification of timed service choreography (Q2875284) (← links)
• (Q3121518) (← links)
• (Q4621139) (← links)
• (Q4989406) (← links)
• Bisimulation on speed: Lower time bounds (Q5313721) (← links)
• A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA (Q5484905) (← links)
• Process algebra for performance evaluation (Q5958464) (← links)
• On continuous time agents (Q6116583) (← links)