… In this survey we report on two analysis problems for communicating automata: the model-checking
problem and a simpler variant of synthesis, called the realizability problem. For …

… Notice that this kind of event-based reasoning arises very naturally when communicating
automata are viewed as sequential automata synchronizing over communication events …

… restarting automata in order to ensure the correctness preserving property for the analysis,
ie, after … In fact, we consider strongly linearized restarting automata. This additional restriction …

… communicating via channels, we propose and study Communicating Timed Automata (CTA), …
By this we show the theoretical limits of analysis of timed systems with unbounded channels…

… The main goal refers to protocol security analysis during the realization of the communication
run that specifies the assessment of the level of current and oncoming threats connected …

… in investigating conditions under which communication safety of team automata is preserved
by … and analysis of large distributed systems with a significant communication behaviour. …

… the application of the present analysis we can blackbox most of these details. What is
fundamental in the application of Chomsky’s hierarchy and automata theory to plant behaviour is …

… automata with large state spaces. This paper investigates (1) how to characterise communication
properties for team automata (… characterisation to verify communication properties by …

… In the case of classical (non-probabilistic) timed automata it … the performance analysis of
probabilistic timed automata and … method to the performance analysis of three probabilistic real-…

… model : the Symbolic Communicating Machines (SCM). We also propose an approximate
reachability analysis method, based on lattice automata. Lattice automata are finite automata, …