<p align="justify">Computer Science is currently facing a grand challenge : finding good design practices for embedded systems. Embedded systems are essentially computers interacting with some physical process. You could find one in a braking systems or in a nuclear power plant for example. They present several design difficulties : first they are reactive systems, interacting indefinitely with their environment. Second,they must satisfy real-time constraints specifying when they should respond, and not only how. Finally, their environment is often deeply continuous, presenting complex dynamics. The formal models of choice for specifying such systems are timed and hybrid automata for which model checking is pretty well studied.</p> <p align="justify">In a first part of this thesis, we study a complete design approach, including verification and code generation, for timed automata. We have to define a new semantics for timed automata, the AASAP semantics, that preserves the decidability properties for model checking and at the same time is implementable. Our notion of implementability is completely novel, and relies on the simulation of a semantics that is obviously implementable on a real platform. We wrote tools for the analysis and code generation and exemplify them on a case study about the well known Philips Audio Control Protocol.</p> <p align="justify">In a second part of this thesis, we study the problem of controller synthesis for an environment specified as a hybrid automaton. We give a new solution for discrete controllers having only an imperfect information about the state of the system. In the process, we defined a new algorithm, based on the monotonicity of the controllable predecessors operator, for efficiently finding a controller and we show some promising applications on a classical problem : the universality test for finite automata.

Signaling games are part of games with imperfect information. The games with imperfect information mean that the player doesn't know all moves of players, which played before him. The signaling game as such are interesting because some players have more information than the others. The better informed group of players can indicate to uninformed players what they know and wait how the opponents react. Generally the move which uninformed party takes influence all players. In my papers I want to describe main rules for signaling games, show possible ways how to solve this kinds of problems and use this new knowledge in aplication on problem which can be usable in practices.

In recent years, extensive research has been devoted to opportunistically exploiting spectrum in a distributed cognitive radio network. In such a network, autonomous secondary users (SUs) compete with each other for better channels without instructions from a centralized authority or explicit coordination among SUs. Channel selection relies on channel occupancy information observed by SUs, including whether a channel is occupied by a PU or an SU. Therefore, the SUs' performance depends on the quality of the information. Current research in this area often assumes that the SUs can distinguish a channel occupied by a PU from one occupied by another SU. This can potentially be achieved using advanced signal detection techniques but not by simple energy detection. However, energy detection is currently the primary detection technique proposed for use in cognitive radio networks. This creates a need to design a channel selection strategy under the assumption that, when SUs observe channel availability, they cannot distinguish between a channel occupied by a PU and one occupied by another SU. Also, as energy detection is simpler and less costly than more advanced signal detection techniques, it is worth understanding the value associated with better channel occupancy information. The first part of this thesis investigates the impact of different types of imperfect information on the performance of secondary users (SUs) attempting to opportunistically exploit spectrum resources in a distributed manner in a channel environment where all the channels have the same PU duty cycle. We refer to this scenario as the homogeneous channel environment. We design channel selection strategies that leverage different levels of information about channel occupancy. We consider two sources of imperfect information: partial observability and sensing errors. Partial observability models SUs that are unable to distinguish the activity of PUs from SUs. Therefore, under the partial observability models, SUs can only observe whether a channel was occupied or not without further distinguishing it was occupied by a PU or by SUs. This type of imperfect information exists, as discussed above, when energy detection is adopted as the sensing technique. We propose two channel selection strategies under full and partial observability of channel activity and evaluate the performance of our proposed strategies through both theoretical and simulation results. We prove that both proposed strategies converge to a stable orthogonal channel allocation when the missed detection rate is zero. The simulation results validate the efficiency and robustness of our proposed strategies even with a non-zero probability of missed detection. The second part of this thesis focuses on computing the probability distribution of the number of successful users in a multi-channel random access scheme. This probability distribution is commonly encountered in distributed multi-channel communication systems. An algorithm to calculate this distribution based on a recursive expression was previously proposed. We propose a non-recursive algorithm that has a lower execution time than the one previously proposed in the literature. The third part of this thesis investigates secondary users (SUs) attempting to opportunistically exploit spectrum resources in a scenario where the channels have different duty cycles, which we refer to as the heterogeneous channel environment. In particular, we model the channel selection process as a one shot game. We prove the existence of a symmetric Nash equilibrium for the proposed static game and design a channel selection strategy that achieves this equilibrium. The simulation results compare the performance of the Nash equilibrium to two other strategies(the random and the proportional strategies) under different PU activity scenarios. / Master of Science

<p align="justify">Computer Science is currently facing a grand challenge :finding good design practices for embedded systems. Embedded systems are essentially computers interacting with some physical process. You could find one in a braking systems or in a nuclear power plant for example. They present several design difficulties :first they are reactive systems, interacting indefinitely with their environment. Second,they must satisfy real-time constraints specifying when they should respond, and not only how. Finally, their environment is often deeply continuous, presenting complex dynamics. The formal models of choice for specifying such systems are timed and hybrid automata for which model checking is pretty well studied.</p> <p><p align="justify">In a first part of this thesis, we study a complete design approach, including verification and code generation, for timed automata. We have to define a new semantics for timed automata, the AASAP semantics, that preserves the decidability properties for model checking and at the same time is implementable. Our notion of implementability is completely novel, and relies on the simulation of a semantics that is obviously implementable on a real platform. We wrote tools for the analysis and code generation and exemplify them on a case study about the well known Philips Audio Control Protocol.</p> <p><p align="justify">In a second part of this thesis, we study the problem of controller synthesis for an environment specified as a hybrid automaton. We give a new solution for discrete controllers having only an imperfect information about the state of the system. In the process, we defined a new algorithm, based on the monotonicity of the controllable predecessors operator, for efficiently finding a controller and we show some promising applications on a classical problem :the universality test for finite automata. / Doctorat en sciences, Spécialisation Informatique / info:eu-repo/semantics/nonPublished