Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    On Global Scheduling Independency in Networks of Timed Automata

    Networks of timed automata are a widely used formalism to model timed systems. Models are often concise and convenient since timed automata abstract from many details of actual implementations. One such abstra...

    Sergio Feo-Arenis, Milan Vu**ović in Formal Modeling and Analysis of Timed Syst… (2017)

  2. No Access

    Chapter and Conference Paper

    Reducing Quasi-Equal Clocks in Networks of Timed Automata

    We introduce the novel notion of quasi-equal clocks and use it to improve the verification time of networks of timed automata. Intuitively, two clocks are quasi-equal if, during each run of the system, they have ...

    Christian Herrera, Bernd Westphal in Formal Modeling and Analysis of Timed Syst… (2012)