An efficiency preorder for processes
From MaRDI portal
Publication:1323358
DOI10.1007/BF01191894zbMath0790.68039MaRDI QIDQ1323358
S. Arun-Kumar, Matthew C. B. Hennessy
Publication date: 30 June 1994
Published in: Acta Informatica (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)
Related Items
New up-to techniques for weak bisimulation, Trees from Functions as Processes, Bisimulation on speed: Lower time bounds, Bisimulation on speed: Worst-case efficiency, An algebraic framework for developing and maintaining real-time systems, Complete Lattices and Up-To Techniques, Faster asynchronous systems., A semantic theory of the Internet of things, Unnamed Item, Unnamed Item, Towards a unified approach to encodability and separation results for process calculi, Unique solutions of contractions, CCS, and their HOL formalisation, The Paths to Choreography Extraction, Towards a Unified Approach to Encodability and Separation Results for Process Calculi, Unnamed Item, Up-to Techniques for Branching Bisimilarity, Using bisimulation proof techniques for the analysis of distributed abstract machines, Characteristic Formulae for Timed Automata, Formalising Java RMI with explicit code mobility, Locality and interleaving semantics in calculi for mobile processes, On the expressiveness of internal mobility in name-passing calculi, Counting the Cost in the Picalculus (Extended Abstract), Fast asynchronous systems in dense time, Bisimulation on speed: a unified approach, The Calculus of Handshake Configurations, Comparing communication primitives via their relative expressive power, Equations, Contractions, and Unique Solutions, On performance congruences for process algebras, On the expressiveness of internal mobility in name-passing calculi, Basic observables for processes, Processes against tests: on defining contextual equivalences, Unnamed Item, Communication and mobility control in boxed ambients, On an open problem of Amadio and Curien: The finite antichain condition, Absolute versus relative time in process algebras., What is a ``good encoding of guarded choice?, Decoding choice encodings, Synchrony vs Asynchrony in Communication Primitives, An Operational Semantics for Shared Messaging Communication, Monitoring for Silent Actions, Communication errors in the \(\pi\)-calculus are undecidable, Efficiency of asynchronous systems, read arcs, and the MUTEX-problem, An efficiency preorder for processes
Cites Work
