Algebraic theory of processes
Theoretical Computer Science
An efficiency preorder for processes
Acta Informatica
Trace algebra for automatic verification of real-time concurrent systems
Trace algebra for automatic verification of real-time concurrent systems
Time-constrained buffer specifications in CSP + T and timed CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
An operational semantics for timed CSP
Information and Computation
A process algebra for timed systems
Information and Computation
Timed testing of concurrent systems
Information and Computation
On the coarsest congruence within global-clock-bounded equivalence
Theoretical Computer Science
Distributed Algorithms
Communication and Concurrency
Fast Asynchronous Systems in Dense Time
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd 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
Predictability of real-time systems: a process-algebraic approach
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
| Hi-index | 0.00 |
A timed process algebra is developed for evaluating the temporal worst-case efficiency of asynchronous concurrent systems. For the sake of simplicity, we use a classical CCS-like algebra where actions may occur arbitrarily within a continuous time interval, yielding arbitrary relative speeds of the components. Via the timed testing approach, asynchronous systems are then related w.r.t. their worst-case efficiency, yielding an efficiency preorder. We show that this preorder can just as well be based on much simpler discrete time and that it can be characterized with some kind of refusal traces. Finally, precongruence results are provided for all operators of the algebra, where prefix, choice and recursion require special attention.