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