Pages that link to "Item:Q1323358"
From MaRDI portal
The following pages link to An efficiency preorder for processes (Q1323358):
Displaying 43 items.
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- Locality and interleaving semantics in calculi for mobile processes (Q672123) (← links)
- Using bisimulation proof techniques for the analysis of distributed abstract machines (Q935472) (← links)
- Comparing communication primitives via their relative expressive power (Q1004386) (← links)
- On performance congruences for process algebras (Q1275822) (← links)
- On the expressiveness of internal mobility in name-passing calculi (Q1276243) (← links)
- Basic observables for processes (Q1286368) (← links)
- An efficiency preorder for processes (Q1323358) (← links)
- Faster asynchronous systems. (Q1401952) (← links)
- Communication errors in the \(\pi\)-calculus are undecidable (Q1606997) (← links)
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem (Q1607225) (← links)
- A semantic theory of the Internet of things (Q1706144) (← links)
- Absolute versus relative time in process algebras. (Q1854325) (← links)
- What is a ``good'' encoding of guarded choice? (Q1854329) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Towards a unified approach to encodability and separation results for process calculi (Q1959439) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- Unique solutions of contractions, CCS, and their HOL formalisation (Q2216120) (← links)
- New up-to techniques for weak bisimulation (Q2373744) (← links)
- Formalising Java RMI with explicit code mobility (Q2463558) (← links)
- Bisimulation on speed: a unified approach (Q2503326) (← links)
- Communication and mobility control in boxed ambients (Q2573334) (← links)
- On an open problem of Amadio and Curien: The finite antichain condition (Q2573335) (← links)
- Characteristic Formulae for Timed Automata (Q2729632) (← links)
- Synchrony vs Asynchrony in Communication Primitives (Q2866346) (← links)
- An Operational Semantics for Shared Messaging Communication (Q2871831) (← links)
- The Paths to Choreography Extraction (Q2988384) (← links)
- Up-to Techniques for Branching Bisimilarity (Q3297777) (← links)
- (Q3384919) (← links)
- (Q3385647) (← links)
- Complete Lattices and Up-To Techniques (Q3498446) (← links)
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi (Q3541040) (← links)
- The Calculus of Handshake Configurations (Q3617732) (← links)
- (Q4222914) (← links)
- Trees from Functions as Processes (Q4585071) (← links)
- An algebraic framework for developing and maintaining real-time systems (Q5096395) (← links)
- Monitoring for Silent Actions (Q5136296) (← links)
- (Q5155688) (← links)
- Counting the Cost in the Picalculus (Extended Abstract) (Q5166616) (← links)
- Equations, Contractions, and Unique Solutions (Q5278202) (← links)
- Bisimulation on speed: Lower time bounds (Q5313721) (← links)
- Fast asynchronous systems in dense time (Q5940928) (← links)
- Testing processes for efficiency (Q6567760) (← links)
