Pages that link to "Item:Q1892877"
From MaRDI portal
The following pages link to A process algebra for timed systems (Q1892877):
Displaying 50 items.
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions (Q288785) (← links)
- Repairing time-determinism in the process algebra for hybrid systems (Q442292) (← links)
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- A timed calculus for wireless systems (Q650891) (← links)
- A complete axiomatization of timed bisimulation for a class of timed regular behaviours (Q672231) (← links)
- A brief history of Timed CSP (Q674191) (← links)
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces (Q831141) (← links)
- Duplication of constants in process algebra (Q864505) (← links)
- A timed semantics of Orc (Q935476) (← links)
- Testing from a stochastic timed system with a fault model (Q1001893) (← links)
- Semantics and expressiveness of ordered SOS (Q1012119) (← links)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- Formal models and analysis of secure multicast in wired and wireless networks (Q1040779) (← links)
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time (Q1128976) (← links)
- Towards an algebra for timed behaviours (Q1199544) (← links)
- On performance congruences for process algebras (Q1275822) (← links)
- An efficiency preorder for processes (Q1323358) (← links)
- Recursion induction for real-time processes (Q1329195) (← links)
- The algebra of timed processes, ATP: Theory and application (Q1336052) (← links)
- A process algebra of communicating shared resources with dense time and priorities (Q1389685) (← links)
- Revisiting timing in process algebra. (Q1394990) (← links)
- Faster asynchronous systems. (Q1401952) (← links)
- Bisimulation indexes and their applications (Q1606119) (← links)
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem (Q1607225) (← links)
- Virtually timed ambients: a calculus of nested virtualization (Q1683706) (← links)
- A semantic theory of the Internet of things (Q1706144) (← links)
- Process algebra for hybrid systems (Q1781998) (← links)
- Process algebra with timing (Q1847280) (← links)
- Discrete time generative-reactive probabilistic processes with different advancing speeds (Q1853593) (← links)
- Absolute versus relative time in process algebras. (Q1854325) (← links)
- A timed concurrent constraint language. (Q1854359) (← links)
- Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
- Discrete time process algebra (Q1914041) (← links)
- Timing and causality in process algebra (Q1924998) (← links)
- Composition methods for constructing characteristic formulas for dense-time models (Q1938922) (← links)
- A probabilistic calculus of cyber-physical systems (Q2042728) (← links)
- Sound reasoning in \textit{tock}-CSP (Q2120813) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- The reversible temporal process language (Q2165209) (← links)
- Testing equivalences of time Petri nets (Q2217206) (← links)
- A process calculus approach to detection and mitigation of PLC malware (Q2235740) (← links)
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions (Q2340255) (← links)
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs (Q2348797) (← links)
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency (Q2350494) (← links)
- Bisimulation on speed: a unified approach (Q2503326) (← links)
- Real time process algebra (Q2640341) (← links)
- Reactive bisimulation semantics for a process algebra with timeouts (Q2687033) (← links)
- Discrete time process algebra and the semantics of SDL (Q2760255) (← links)
