Abstract
In this paper, the sketch of a formal semantics for a language for describing hybrid systems, called Hybrid CSP, is given in a Duration Calculus of Weakly Monotonic Time. In the semantic model, discrete transitions take no time and can take place simultaneously in a specified order. It can therefore serve as a duration semantics for hybrid systems over superdense computations.
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.
