%0 Conference Proceedings
%T On Efficiency Preorders
%+ School of Computing Science [Glasgow]
%+ Department of Computer Science and Engineering
%+ Department of Computer Science and Engineering [New Delhi]
%A Gaur, Manish
%A Arun-Kumar, S.
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 5th International Conference on Fundamentals of Software Engineering (FSEN)
%C Tehran, Iran
%Y Farhad Arbab
%Y Marjan Sirjani
%I Springer Berlin Heidelberg
%3 Fundamentals of Software Engineering
%V LNCS-8161
%P 83-94
%8 2013-04-24
%D 2013
%R 10.1007/978-3-642-40213-5_6
%Z Computer Science [cs]Conference papers
%X Theories of efficiency preorders and precongruences for concurrent systems have been described in various papers. We describe a procedure to implement two of these precongruences. Considering the extra information that is needed to be maintained while computing efficiency preorders, our procedure with a complexity $O(n^{3}m)$, compares favourably with that for deciding observational equivalence ($O(n^{\alpha }m)$. Further, the algorithm may be plugged in to existing model-checkers such as the Concurrency-Workbench of the New Century (CWB-NC) without any significant overheads of space or time.
%G English
%2 https://inria.hal.science/hal-01514657/document
%2 https://inria.hal.science/hal-01514657/file/978-3-642-40213-5_6_Chapter.pdf
%L hal-01514657
%U https://inria.hal.science/hal-01514657
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC2
%~ IFIP-WG2-2
%~ IFIP-FSEN
%~ IFIP-LNCS-8161