An efficiency preorder for processes
Acta Informatica
An operational semantics for timed CSP
Information and Computation
A process algebra for timed systems
Information and Computation
A theory of processes with durational actions
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Timing and causality in process algebra
Acta Informatica
Fast asynchronous systems in dense time
Theoretical Computer Science
Communication and Concurrency
Handbook of Process Algebra
Process Algebra with Timing
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Efficiency of Token-Passing MUTEX-Solutions - Some Experiments
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
An Algebraic Theory of Process Efficiency
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A faster-than relation for asynchronous processes
A faster-than relation for asynchronous processes
Performance of pipelined asynchronous systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
A logical characterization of efficiency preorders
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
This paper introduces a novel (bi)simulation-based faster-than preorder which relates asynchronous processes with respect to their worst-case timing behavior. The studies are conducted for a conservative extension of the process algebra CCS, called TACS, which permits the specification of maximal time bounds of actions. The most unusual contribution is in showing that the proposed faster-than preorder coincides with two other preorders, one of which considers the absolute times at which actions occur in system runs. The paper also develops the semantic theory of TACS, addressing congruence properties, equational laws, and abstractions from internal actions.