Perfect Timed Communication Is Hard

Abdulla, Parosh Aziz; Atig, Mohamed Faouzi; Krishna, Shankara Narayanan

doi:10.1007/978-3-030-00151-3_6

Cited by 3 publications

(4 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, all these works are restricted to a single stack, while we tackle several data structures including multiple stacks, queues. Many recent papers [16,14,1] consider complex constraints between data structures and clocks. In these papers, there are time constraints between data structures d 1 , d 2 , between clocks, and also between a clock c and a data structure d. All of these can be modeled easily in our case, as can be seen in Section 5.…”

Section: Related Workmentioning

confidence: 99%

“…Many recent papers [16,14,1] consider complex constraints between data structures and clocks; however, this intricate flow of information across clocks and data structures has not been looked at, to the best of our knowledge. In these papers, there are time constraints between data structures d 1 , d 2 , between clocks, and also between a clock c and a data structure d. All of these can be modeled easily in our case, as shown in Figure 10.…”

Section: Clock Renaming Via Trackingmentioning

confidence: 99%

“…Several variants and extensions of this basic model have been considered over the years, for instance using event-clocks [8] or diagonal constraints, or even by allowing (non-) deterministic updates of clocks. Subsequently, there has been a growing body of work [2,1,5,6,14,15,16,17,25] towards adding auxiliary data structures like stacks [27,4,3] or queues [3] to such timed automata. In all these, the techniques used to solve the emptiness problem were specific and tailor-made to the choice of the data structure, kind of constraints and updates that are allowed.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Timed Systems through the Lens of Logic

Akshay¹,

Gastin²,

Jugé³

et al. 2019

2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Self Cite

View full text Add to dashboard Cite

In this paper, we analyze timed systems with data structures. We start by describing behaviors of timed systems using graphs with timing constraints. Such a graph is called realizable if we can assign time-stamps to nodes or events so that they are consistent with the timing constraints. The logical definability of several graph properties [19,9] has been a challenging problem, and we show, using a highly non-trivial argument, that the realizability property for collections of graphs with strict timing constraints is logically definable in a class of propositional dynamic logic (EQ-ICPDL), which is strictly contained in MSO. Using this result, we propose a novel, algorithmically efficient and uniform proof technique for the analysis of timed systems enriched with auxiliary data structures, like stacks and queues. Our technique unravels new results (for emptiness checking as well as model checking) for timed systems with richer features than considered so far, while also recovering existing results. ACM Subject ClassificationTheory of computation → Quantitative automata; Theory of computation → Logic and verification; Theory of computation → Timed and hybrid models

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Clock Renaming Via Trackingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Timed Systems through the Lens of Logic

Akshay¹,

Gastin²,

Jugé³

et al. 2019

2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…also [24]), a rich literature has emerged considered more challenging verification problems, including the symbolic description of the reachability relation [19,21,32,22,26]. There are many natural generalizations of TA to add extra modelling capabilities, including time Petri Nets [37,39] (which associate timing constraints to transitions) the already mentioned timed Petri nets (TdPN) [42,6,27] (where tokens carry clocks which are tested by transitions), networks of timed processes [5], several variants of timed pushdown automata [12,20,8,44,4,41,9,18,17], timed communicating automata [33,16,3,15], and their lossy variant [1], and timed process calculi based on Milners CCS (e.g. [10]).…”

Section: Related Researchmentioning

confidence: 99%

Timed Basic Parallel Processes

Clemente,

Hofman,

Totzke

2019

Preprint

View full text Add to dashboard Cite

Timed basic parallel processes (TBPP) extend communication-free Petri nets (aka. BPP or commutative context-free grammars) by a global notion of time. TBPP can be seen as an extension of timed automata (TA) with context-free branching rules, and as such may be used to model networks of independent timed automata with process creation.We show that the coverability and reachability problems (with unary encoded target multiplicities) are PSPACE-complete and EXPTIME-complete, respectively. For the special case of 1-clock TBPP, both are NP-complete and hence not more complex than for untimed BPP. This contrasts with known super-Ackermannian-completeness and undecidability results for general timed Petri nets.As a result of independent interest, and basis for our NP upper bounds, we show that the reachability relation of 1-clock TA can be expressed by a formula of polynomial size in the existential fragment of linear arithmetic, which improves on recent results from the literature.

show abstract