Abstract
Processes of timed process algebras may be modelled as timed transition systems. A timed transition system is a labelled transition system whose sort is timed, that is labels are either action labels or elements from a time domain.Modal logics can be used to express properties of transition systems. Timed modal logics are modal logics whose sort is timed. hi this paper we consider timed propositional modal logic and timed modal μ-calculus. Definability of important timed properties is the main body of the paper. The properties under consideration include time determinism, time additivity, maximal progress and finite variability.Finally, minimal timed logics for the classes of time deterministic and time additive transition systems are chracterised axiomatically.KeywordsModal LogicTransition SystemOperational SemanticAxiom SystemLabel Transition SystemThese 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.
Sign-in/Register to access full text options 
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.
