Pages that link to "Item:Q1403331"

The following pages link to Comparing the worst-case efficiency of asynchronous systems with PAFAS (Q1403331):

Displayed 13 items.

• Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions (Q288785) ‎ (← links)
• Performance of pipelined asynchronous systems (Q864507) ‎ (← links)
• Liveness of a mutex algorithm in a fair process algebra (Q1015393) ‎ (← links)
• Faster asynchronous systems. (Q1401952) ‎ (← links)
• Measuring the performance of asynchronous systems with PAFAS (Q1781997) ‎ (← links)
• Composition methods for constructing characteristic formulas for dense-time models (Q1938922) ‎ (← links)
• Testing equivalences of time Petri nets (Q2217206) ‎ (← links)
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) ‎ (← links)
• Fairness of components in system computations (Q2491632) ‎ (← links)
• Fairness of actions in system computations (Q2502272) ‎ (← links)
• Time and Fairness in a Process Algebra with Non-blocking Reading (Q3599073) ‎ (← links)
• (Q5014797) ‎ (← links)
• Bisimulation on speed: Lower time bounds (Q5313721) ‎ (← links)