Abstract : Timed-pNets is a semantic model to specify the communi-cation behaviours of distributed systems. It has a tree style hierarchical structure. The leaves are timed specifications which consist of a set of logical clocks and clock relations. These logical clocks are encoded with delay variables and delay bound. In this paper we discuss how to detect time constraint conflicts and how to compute delay variables of clocks in the non-leaf nodes. Then we can check system's time properties like deadline. From our formalization of timed-pNets, we generate a system of logical clocks that can be simulated in the TimeSquare tool. We take a simple use case from ITS to simulate and check some time properties.
Contributeur : Eric Madelaine <>
Soumis le : lundi 22 décembre 2014 - 10:00:10
Dernière modification le : lundi 5 octobre 2015 - 16:59:31
Document(s) archivé(s) le : lundi 23 mars 2015 - 19:11:26