Abstract
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.KeywordsSemantic TheoryInternal ActionParallel CompositionProcess AlgebraInternal ComputationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Submitted Version
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
