Over the last years there has been an increasing research eeort directed towards the automatic veriication of innnite state systems, such as timed automata, hybrid automata, data-independent systems, rela-tional automata, Petri nets, and lossy channel systems. We present a method for deciding reachability properties of networks of timed processes. Such a network consists of an arbitrary set of ...

This paper reports the results of a case study on the feasibility of developing and applying mechanical methods, based on the proof system PVS, to prove propositions about real-time systems speci ed in the LynchVaandrager timed automata model. In using automated provers to prove propositions about systems described by a speci c mathematical model, both the proofs and the proof process can be si...

This work presents a Model Driven Engineering (MDE) approach for the automatic generation of a network of timed automata from the functional specification of an embedded application described using UML class and sequence diagrams. By means of transformations on the UML model of the embedded system, a MOF-based representation for the network of timed automata is automatically obtained, which can...

Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Timed Automata and Probabilistic Timed Automata. In this paper we focus on cost-bounded probabilistic reachability for PPTA, which determines if the maximal probability to reach a goal location within a given cost bound ...

One of the most successful techniques for automatic verification is that of model checking. For finite automata there exist since long extremely efficient model–checking algorithms, and in the last few years these algorithms have been made applicable to the verification of real–time automata using the region–techniques of Alur and Dill. In this paper, we continue this transfer of existing techn...