A faster-than relation for asynchronous processes
"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 for actions."--Abstract
Microform, English, 2001
Institute for Computer Applications in Science and Engineering, NASA Langley Research Center ; National Technical Information Service, distributor, Hampton, VA, Springfield, VA, 2001