• Aucun résultat trouvé

Contraction of the ITCPN state space

N/A
N/A
Protected

Academic year: 2021

Partager "Contraction of the ITCPN state space"

Copied!
16
0
0

Texte intégral

Loading

Figure

Fig. 1. An ITCPN model
Fig. 3. Bounded ITCPN but unbounded CPN
Fig. 4. A timed automaton

Références

Documents relatifs

A way to fill in the cells of 3 × 3-matrix with 9 real numbers is called a magic square if sums of numbers in all rows are pairwise equal, and equal to sums of numbers in all

In Section 5, we first propose an EXPTIME algorithm for model-checking one-clock priced timed automata against WCTL formulas, then refine it to get a PSPACE algorithm, and finally

The purpose of this paper is to develop techniques for an- alyzing the infinite behaviours of timed automata by means of a probabilistic almost-sure interpretation of LTL over

We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study

Fr- Concentration optimale pour la sclérothérapie à la mousse d’une grande veine saphène pathologique avec un tronc de diamètre régulier à 6 mm en cuisse … (Cocher la

Fr- Pendant l’injection de cyanoacrylate dans la grande veine saphène (ablation par glue), la compression de la jonction saphéno-fémorale est … (Cocher la bonne réponse):.. In

In this paper, we aim to study model-checking algorithms for probabilistic timed au- tomata [13, 15], a variant of timed automata extended with discrete probability distribu- tions,

First we show that the reachability problem is NLOGSPACE-complete for one clock TAs (i.e. as complex as reachability in classical graphs) and we give a polynomial time algorithm