A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Journal of the ACM (JACM)
Extensional equivalence for transition systems
Acta Informatica
Algebraic theory of processes
Trace, failure and testing equivalences for communicating processes
International Journal of Parallel Programming
Information and Computation
Process algebra
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
An efficiency preorder for processes
Acta Informatica
A process algebra for timed systems
Information and Computation
Communication and Concurrency
Timed Testing of Concurrent Systems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Predictability of real-time systems: a process-algebraic approach
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Theoretical Computer Science
A Faster-than Relation for Asynchronous Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Comparing the Efficiency of Asynchronous Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Information and Computation
Bisimulation on speed: worst-case efficiency
Information and Computation
Bisimulation on speed: a unified approach
Theoretical Computer Science
Q-Automata: Modelling the Resource Usage of Concurrent Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficiency of asynchronous systems that communicate asynchronously
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
A logical characterization of efficiency preorders
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Bisimulation on speed: a unified approach
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
On the Relationships among four Timed Process Algebras
Fundamenta Informaticae
| Hi-index | 0.00 |
This paper presents a testing-based semantic theory for reasoning about the efficiency of concurrent systems as measured in terms of the amount of their internal activity. The semantic preorders are given an algebraic characterization, and their optimality is established by means of a full abstractness result. They are also shown to subsume existing bisimulation-based efficiency preorders. An example is provided to illustrate the utility of this approach.