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

    Verification of GUI Applications: A Black-Box Approach

    In this paper, we propose to base the verification of a GUI application on a reference model used in black-box testing. The reference model is a formal model for the behavior of the GUI application. It is derived...

    Stephan Arlt, Evren Ermis, Sergio Feo-Arenis in Leveraging Applications of Formal Methods,… (2014)

  3. No Access

    Chapter and Conference Paper

    Formal Verification of a Parameterized Data Aggregation Protocol

    We report on our experiences on the successful verification of a parameterized wireless fault-tolerant data aggregation protocol. We outline our verification method that involves automatic verification of a mo...

    Sergio Feo-Arenis, Bernd Westphal in NASA Formal Methods (2013)

  4. 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)