An efficiency preorder for processes
Acta Informatica
A process algebra for timed systems
Information and Computation
PAM: a process algebra manipulator
Formal Methods in System Design
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Introduction to Algorithms
A Semantics Based Verification Tool for Finite State Systems
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A complexity effective communication model for behavioral modeling of signal processing applications
Proceedings of the 40th annual Design Automation Conference
Bisimulation on speed: a unified approach
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Bisimulation on speed: a unified approach
Theoretical Computer Science
Simulations Up-to and Canonical Preorders
Electronic Notes in Theoretical Computer Science (ENTCS)
An Operational Semantics for Shared Messaging Communication
Electronic Notes in Theoretical Computer Science (ENTCS)
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations
Electronic Notes in Theoretical Computer Science (ENTCS)
New Bisimulation Semantics for Distributed Systems
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
(Bi)simulations up-to characterise process semantics
Information and Computation
Counting the Cost in the Picalculus (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional reasoning for markov decision processes
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Defining distances for all process semantics
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
| Hi-index | 0.00 |
We introduce a quantitative concept for bisimulations by integrating the notion of amortisation (cf. [3]). This allows us to make behavioural comparisons between nondeterministic systems that are inherently non-terminating and to analyse the relative long-term costs of deploying them. To this end, we conservatively extend CCS to include a new set of cost-based actions and define a cost-based quantitative relation called amortised bisimulation. We demonstrate the applicability of our approach by two case studies. In both cases the cost of additional administration is shown to amortise. We furthermore show that the amortised preorder for speed introduced in [6] is naturally expressible in our setting.