Reachability of Communicating Timed Processes

@inproceedings{Clemente2013ReachabilityOC,
  title={Reachability of Communicating Timed Processes},
  author={Lorenzo Clemente and Fr{\'e}d{\'e}ric Herbreteau and Am{\'e}lie Stainer and Gr{\'e}goire Sutre},
  booktitle={FoSSaCS},
  year={2013}
}
We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over unbounded FIFO channels. Each automaton can only access its set of local clocks; all clocks evolve at the same rate. Our main contribution is a complete characterization of decidable and undecidable communication topologies, for both discrete and dense time. We also obtain complexity results, by showing that… 

Decidability of Timed Communicating Automata

TLDR
This work provides a complete characterisation of decidable and undecidable communication topologies generalising and unifying previous work on the reachability problem for networks of timed communicating processes.

Communicating Timed Processes with Perfect Timed Channels

TLDR
This paper shows that the reachability problem is undecidable even in the case of two timed automata connected by one unidirectional timed channel if one allows global clocks (that the two automata can check and manipulate), and proves that this undecidability still holds even for CTA consisting of three timed automaton and two uniddirectional timed channels.

Perfect Timed Communication Is Hard

TLDR
This paper shows that the reachability problem is undecidable even in the case of two timed automata connected by one unidirectional timed channel if one allows global clocks (that the two automata can check and manipulate), and proves that this undecidability still holds even for CTA consisting of three timed automaton and two uniddirectional timed channels.

What is Decidable about Perfect Timed Channels?

TLDR
This paper proves that the reachability problem is undecidability even in the case of two timed automata connected by one unidirectional timed channel if one allows global clocks (that the two automata can check and manipulate), and shows the bounded-context case, where in each context only one timed automaton is allowed to receive messages from one channel while being able to send messages to all the other timed channels.

Deadlines Together

This paper studies safety, progress, and non-zeno properties of Communicating Timed Automata (CTAs), which are timed automata (TA) extended with unbounded communication channels, and presents a

Meeting Deadlines Together

This paper studies safety, progress, and non-zeno properties of Communicating Timed Automata (CTAs), which are timed automata (TA) extended with unbounded communication channels, and presents a

Timed Basic Parallel Processes

TLDR
It is shown 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.

Decidable Classes of Unbounded Petri Nets with Time and Urgency

TLDR
The goal is to investigate decidable classes of Petri nets with time that capture some urgency and still allow unbounded behaviors, which go beyond finite state systems.

Timed Petri Nets with (restricted) Urgency

TLDR
This work presents the first decidability results for Petri Net vari-ants combining time, urgency and unbounded places, and obtainsDecidability of control-state reachability for the subclass of Timed Petri Nets with Urgency where urgency constraints can only be used on bounded places.

Data Communicating Processes with Unreliable Channels

TLDR
This work extends the classical model of lossy channel systems by considering systems that operate on a finite set of variables ranging over an infinite data domain and shows decidability of state reachability in this case by computing a symbolic encoding of the set of system configurations that are reachable from a given configuration.

References

SHOWING 1-10 OF 26 REFERENCES

Model checking time-constrained scenario-based specifications

TLDR
It is shown that regular collections of time-constrained MSCs can be translated into a special class of event-clock automata that can be determinized and complemented, thus permitting an algorithmic solution to the model checking problem.

Automata and Logics for Timed Message Sequence Charts

TLDR
It is proved that, for (existentially) bounded channels, emptiness and satisfiability are decidable for the automata and logic of this timed model of communicating finite-state machines.

Reachability Analysis of Communicating Pushdown Systems

TLDR
The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability, and this work extends a model based on communicating pushdown systems that can dequeue with empty stack only, which adds the dual modality.

Communicating Timed Automata: The More Synchronous, the More Difficult to Verify

TLDR
The goal is to study the borderline between decidable and undecidable classes of channel systems in the timed setting, and the technical results suggest that verification problems such as checking state reachability and channel boundedness are decidable.

Dense-Timed Pushdown Automata

TLDR
The main contribution of the paper is an EXPTIME-complete algorithm for solving the reachability problem for dense-timed pushdown automata.

Context-Bounded Analysis of Concurrent Queue Systems

We show that the bounded context-switching reachability problem for concurrent finite systems communicating using unbounded FIFO queues is decidable, where in each context a process reads from only

Matching Scenarios with Timing Constraints

TLDR
This work considers the problem of checking whether these timed MSCs are “consistent” with those provided in a timed M SC specification and outlines an approach to solve this problem that can be automated using Uppaal.

On the Verification of Timed Ad Hoc Networks

TLDR
Decidability and undecidability results for parameterized verification of a formal model of timed Ad Hoc network protocols are studied and compared with those obtained for (fully connected) networks of timed automata.

Comparison of Different Semantics for Time Petri Nets

TLDR
This paper studies the model of Time Petri Nets (TPNs) where a time interval is associated with the firing of a transition, but it is extended by considering general intervals rather than closed ones and concludes that persistent atomic semantics should be preferred.

Verifying programs with unreliable channels

  • P. AbdullaB. Jonsson
  • Computer Science, Mathematics
    [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
  • 1993
TLDR
The verification of a particular class of infinite-state systems, namely, systems consisting of finite-state processes that communicate via unbounded lossy FIFO channels, is considered and it is shown that several interesting verification problems are decidable by giving algorithms for verifying.