15 research outputs found

    Mightyl: A compositional translation from mitl to timed automata

    Get PDF
    Metric Interval Temporal Logic (MITL) was first proposed in the early 1990s as a specification formalism for real-time systems. Apart from its appealing intuitive syntax, there are also theoretical evidences that make MITL a prime real-time counterpart of Linear Temporal Logic (LTL). Unfortunately, the tool support for MITL verification is still lacking to this day. In this paper, we propose a new construction from MITL to timed automata via very-weak one-clock alternating timed automata. Our construction subsumes the well-known construction from LTL to BĂŒchi automata by Gastin and Oddoux and yet has the additional benefits of being compositional and integrating easily with existing tools. We implement the construction in our new tool MightyL and report on experiments using Uppaal and LTSmin as back-ends

    The Acid-rain Game As a Resource-allocation Process With An Application To the International-cooperation Among Finland, Russia and Estonia

    No full text
    We consider optimal cooperation in transboundary air pollution abatement among several countries under incomplete information, i.e., local information only on marginal emission abatement costs and damage costs. Directions of emission abatement in each country are determined that generate a succession of emissions programs shown to converge to an economic optimum. A cost sharing scheme, that results from appropriately designed international transfers, guarantees that the individual costs of all parties are nonincreasing along the path towards the optimum. A version of Maler's (1989) ''acid rain game'' is used for a numerical application

    Timed temporal logics

    Get PDF
    International audienceSince the early 1990's, classical temporal logics have been extended with timing constraints. While temporal logics only express contraints on the order of events, their timed extensions can add quantitative constraints on delays between those events. We survey expressive-ness and algorithmic results on those logics, and discuss semantic choices that may look unimportant but do have an impact on the questions we consider
    corecore