Closed, Open, and Robust Timed Networks

Abdulla, Parosh Aziz; Deneux, Johann; Mahata, Pritha

doi:10.1016/j.entcs.2005.03.027

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

Publication Types

Select...

Book1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The existing approaches are less numerous than for untimed systems. The work in [5,3] concentrates on decidability: the authors show the decidability of the reachability of PTSs where processes are timed automata with either only one clock or otherwise time is discrete. These results have been later generalised to timed ad hoc networks in [2] where it is shown that even for processes as timed automata with one clock, for star topologies where the diameter between nodes is of length 5, the reachability problem is undecidable.…”

Section: Introductionmentioning

confidence: 99%

Compositional Verification of Parameterised Timed Systems

Aştefănoaei

Rayana

Bensalem

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

International audienceIn this paper we address the problem of uniform verification of parameterised timed systems (PTS): " does a given safety state property hold for a system containing n identical timed components regardless of the value of n? ". Our approach is compositional and consequently it suits quite well such systems in that it presents the advantage of reusing existing local characterisations at the global level of system characteri-sation. Additionally, we show how a direct consequence of the modelling choices adopted in our framework leads to an elegant application of the presented method to topologies such as stars and rings

show abstract

Section: Introductionmentioning

confidence: 99%