Log in

Relevant bibliographies by topics / Timed automata / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Timed automata.

Dissertations / Theses on the topic 'Timed automata'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Timed automata.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Carlier, Pierre. "Verification of Stochastic Timed Automata." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLN058/document.

Full text

Abstract:

La vérification est maintenant une branche très connue des sciences informatiques. Elle est cruciale lorsque l'on a affaire à des programmes informatiques dans des systèmes automatiques : on veut vérifier si un système donné est correct et s'il satisfait des propriétés nécessaires à son bon fonctionnement. Une façon d'analyser ces systèmes se fait par la modélisation mathématique. La question est alors : peut-on vérifier si le modèle satisfait les propriétés requises ? C'est ce que l'on appelle le problème du model-checking. Plusieurs modèles ont été étudiés dans la littérature. Nous portons n

APA, Harvard, Vancouver, ISO, and other styles

2

Park, Young-Saeng. "Automatic schedule computation for distributed real-time systems using timed automata." Thesis, Northumbria University, 2008. http://nrl.northumbria.ac.uk/745/.

Full text

Abstract:

The time-triggered architecture is becoming accepted as a means of implementing scalable, safer and more reliable solutions for distributed real-time systems. In such systems, the execution of distributed software components and the communication of messages between them take place in a fixed pattern and are scheduled in advance within a given scheduling round by a global scheduling policy. The principal obstacle in the design of time-triggered systems is the difficulty of finding the static schedule for all resources which satisfies constraints on the activities within the scheduling round, s

APA, Harvard, Vancouver, ISO, and other styles

3

Amnell, Tobias. "Code synthesis for timed automata." Licentiate thesis, Uppsala universitet, Avdelningen för datorteknik, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-86154.

Full text

Abstract:

In this thesis, we study executable behaviours of timed models. The focus is on synthesis of executable code with predictable behaviours from high level abstract models. We assume that a timed system consists of two parts: the control software and the plant (i.e. the environment to be controlled). Both are modelled as timed automata extended with real time tasks. We consider the extended timed automata as design models. We present a compilation procedure to transform design models to executable code including a run-time scheduler (run time system) preserving the correctness and schedulability

APA, Harvard, Vancouver, ISO, and other styles

4

Trivedi, Ashutosh. "Competative optimisation on timed automata." Thesis, University of Warwick, 2009. http://wrap.warwick.ac.uk/2243/.

Full text

Abstract:

Timed automata are finite automata accompanied by a finite set of real-valued variables called clocks. Optimisation problems on timed automata are fundamental to the verification of properties of real-time systems modelled as timed automata, while the control-program synthesis problem of such systems can be modelled as a two-player game. This thesis presents a study of optimisation problems and two-player games on timed automata under a general heading of competitive optimisation on timed automata. This thesis views competitive optimisation on timed automata as a multi-stage decision process,

APA, Harvard, Vancouver, ISO, and other styles

5

Sankur, Ocan. "Robustness in timed automata : analysis, synthesis, implementation." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2013. http://tel.archives-ouvertes.fr/tel-00910333.

Full text

Abstract:

Timed automata are a formalism to model, verify, and synthesize real-time systems. They have the advantage of having an abstract mathematical semantics, which allow formalizing and solving several verification and synthesis problems. However, timed automata are intended to design models, rather than completely describe real systems. Therefore, once the design phase is over, it remains to check whether the behavior of an actual implementation corresponds to that of the timed automaton model. An important step before implementing a system design is ensuring its robustness. This thesis considers

APA, Harvard, Vancouver, ISO, and other styles

6

Ericsson, Ann-Marie. "Deriving ECA-rules from timed-automata specifications." Thesis, University of Skövde, Department of Computer Science, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-655.

Full text

Abstract:

<p>Real-time systems are required to answer to external stimuli within a specified time-period. For this to be possible, the systems behaviour must be predictable. The use of active databases in real-time systems introduces unpredictability in the system, e.g. due to their use of active rules. The behaviour in active databases is usually specified in ECA-rules. Sets of ECA-rules are hard to analyse, which implies that the behaviour of the ECA-rule set is hard to predict.</p><p>The purpose of this project is to evaluate the ability to support the development of a predictable ECA-rule set. Using

APA, Harvard, Vancouver, ISO, and other styles

7

Nehme, Carl 1981. "The VAT tool : automatic transformation of VHDL to timed automata." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17790.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2004.<br>Includes bibliographical references (leaves 61-66).<br>Embedded systems have become an integral part of the systems we use today. These types of systems are constrained by both stringent time requirements and limited resource availability. Traditionally, high-integrity embedded systems operated on well understood hardware platforms. The emergence of inexpensive FPGAs (Field Programmable Gate Arrays) and ASICs (Application Specific Integrated Circuits) as operational platforms for embedded soft

APA, Harvard, Vancouver, ISO, and other styles

8

Hagman, Mikael. "Instrumentation of timed automata for formal verification of timed properties." Thesis, Linköping University, Department of Computer and Information Science, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-9861.

Full text

Abstract:

<p>Embedded systems are used in many technical products of today. The tendency also points to the fact that they are in many ways becoming more and more complex as technology advances. Systems like advanced avionics, air bags, ABS brakes or any real-time embedded system requires reliability, correctness and timeliness. This puts hard pressure on designers, analyzers and developers. The need for high performance and non failing systems has therefore led to a growing interest in modeling and verification of component-based embedded systems in order to reduce costs and simplify design and develop

APA, Harvard, Vancouver, ISO, and other styles

9

Mavrommatis, Panayiotis P. "Simulation of timed input/output automata." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36395.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Includes bibliographical references (p. 73-74).<br>This Master of Engineering Thesis describes the design, implementation, and usage of the TIOA Simulator. The TIOA Simulator, along with the other components of the TIOA Toolset aims to provide a framework for developing dependable distributed systems. The project is based on the

APA, Harvard, Vancouver, ISO, and other styles

10

Widerberg, Ernst. "A Modeling Language for Timed Automata." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-291554.

Full text

Abstract:

This work details the design and implementation of a modeling language for timed automata. The primary intended use of the language TML is as an interface to controller synthesis system m2mc, which is being developed in a current KTH/Chalmers research project. TML is evaluated by a qualitative comparison with the modeling languages of two well-known model checking tools: Uppaal and Kronos. Two example systems (Fischer’s mutual exclusion protocol and CSMA/CD) are implemented in all three languages, to discover the relative merits of each language. Although not as feature rich as Uppaal, TML bri

APA, Harvard, Vancouver, ISO, and other styles

11

Ramadian, Yusi. "Parametric Real-Time System Feasibility Analysis Using Parametric Timed Automata." Doctoral thesis, Università degli studi di Trento, 2012. https://hdl.handle.net/11572/368709.

Full text

Abstract:

Real-time applications are playing an increasingly significant role in our life. The cost and risk involved in their design leads to the need for a correct and robust modelling of the system before its deployment. Many approaches have been proposed to verify the schedulability of real-time task system. A frequent limitation is that they force the task activation to restrictive patterns (e.g. periodic). Furthermore, the type of analysis carried out by the real-time scheduling theory relies on restrictive assumptions that could make the designers miss important optimization opportunities. On the

APA, Harvard, Vancouver, ISO, and other styles

12

Ramadian, Yusi. "Parametric Real-Time System Feasibility Analysis Using Parametric Timed Automata." Doctoral thesis, University of Trento, 2012. http://eprints-phd.biblio.unitn.it/763/1/Dissertation.pdf.

Full text

Abstract:

Real-time applications are playing an increasingly significant role in our life. The cost and risk involved in their design leads to the need for a correct and robust modelling of the system before its deployment. Many approaches have been proposed to verify the schedulability of real-time task system. A frequent limitation is that they force the task activation to restrictive patterns (e.g. periodic). Furthermore, the type of analysis carried out by the real-time scheduling theory relies on restrictive assumptions that could make the designers miss important optimization opportunities. O

APA, Harvard, Vancouver, ISO, and other styles

13

Nolte, Tina Ann 1979. "Virtual stationary timed automata for mobile networks." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/47745.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.<br>Includes bibliographical references (p. 339-347).<br>In this thesis, we formally define a programming abstraction for mobile networks called the Virtual Stationary Automata programming layer, consisting of real mobile clients, virtual timed I/O automata called virtual stationary automata (VSAs), and a communication service connecting VSAs and client nodes. The VSAs are located at prespecified regions that tile the plane, defining a static virtual infrastructure. We present a t

APA, Harvard, Vancouver, ISO, and other styles

14

Nguyen, Hoang Gia. "Efficient Parametric Verification of Parametric Timed Automata." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCD038.

Full text

Abstract:

Les systèmes temps-réel critiques deviennent de plus en plus ubiquitaires et jouent un rôle majeur de nos jours. Pour garantir le bon comportement d’un système, leur correction doit être vériﬁée avant les mises en service opérationnel. Outre la vériﬁcation fonctionnelle, la vériﬁcation du comportement temporel est également cruciale. Les tech niques de vériﬁcation garantissent que les systèmes logiciels ou matériels satisfont les contraintes attendues. La plupart des méthodes de vériﬁcation formelle pour les systèmes temporisés garantissent leur correction pour des valeurs prédéﬁnies des contr

APA, Harvard, Vancouver, ISO, and other styles

15

Tran, Thanh tung. "Verification of timed automata : reachability, liveness and modelling." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0168/document.

Full text

Abstract:

Cette thèse revisite les algorithmes standards pour les problèmes d'accessibilité et de vivacité des automates temporisés. L'algorithme standard pour tester l'accessibilité consiste à utiliser l'inclusion de zones pour explorer efficacement un arbre de recherche abstrait. Cependant, l'ordre du parcours du graphe a une forte incidence sur l'efficacité de l'algorithme. Dans cette thèse nous introduisons deux stratégies, nommées ranking et waiting, et une combinaison des deux. De nombreux exemples montrent que la combinaison des deux stratégies aide l'algorithme d'accessibilité à éviter des explo

APA, Harvard, Vancouver, ISO, and other styles

16

Renard, Matthieu. "Runtime Enforcement of (Timed) Properties with Uncontrollable Events." Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0833/document.

Full text

Abstract:

Cette thèse étudie l’enforcement de propriétés temporisées à l’exécution en présence d’évènements incontrôlables. Les travaux se placent dans le cadre plus général de la vérification à l’exécution qui vise à surveiller l’exécution d’un système afin de s’assurer qu’elle respecte certaines propriétés. Ces propriétés peuvent être spécifiées à l’aide de formules logiques, ou au moyen d’autres modèles formels, parfois équivalents, comme des automates. Nous nous intéressons à l’enforcement à l’exécution de propriétés spécifiées par des automates temporisés. Tout comme la vérification à l’exécution,

APA, Harvard, Vancouver, ISO, and other styles

17

D'Argenio, Pedro Ruben. "Algebras and automata for timed and stochastic systems." Enscheded : [s.n.], 1999. http://www.cs.famaf.unc.edu.ar/~dargenio/Publications/dissertation/dissertation.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

De, Wulf Martin. "From timed models to timed implementations." Doctoral thesis, Universite Libre de Bruxelles, 2006. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210797.

Full text

Abstract:

<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.

APA, Harvard, Vancouver, ISO, and other styles

19

Quaas, Karin. "Kleene-Schützenberger and Büchi Theorems for Weighted Timed Automata." Doctoral thesis, Universitätsbibliothek Leipzig, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-38791.

Full text

Abstract:

In 1994, Alur and Dill introduced timed automata as a simple mathematical model for modelling the behaviour of real-time systems. In this thesis, we extend timed automata with weights. More detailed, we equip both the states and transitions of a timed automaton with weights taken from an appropriate mathematical structure. The weight of a transition determines the weight for taking this transition, and the weight of a state determines the weight for letting time elapse in this state. Since the weight for staying in a state depends on time, this model, called weighted timed automata, has many i

APA, Harvard, Vancouver, ISO, and other styles

20

Grinchtein, Olga. "Learning of Timed Systems." Doctoral thesis, Uppsala University, Department of Information Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8763.

Full text

Abstract:

<p>Regular inference is a research direction in machine learning. The goal of regular inference is to construct a representation of a regular language in the form of deterministic finite automaton (DFA) based on the set of positive and negative examples. DFAs take strings of symbols (words) as input, and produce a binary classification as output, indicating whether the word belongs to the language or not. There are two types of learning algorithms for DFAs: passive and active learning algorithms. In passive learning, the set of positive and negative examples is given and not chosen by inferenc

APA, Harvard, Vancouver, ISO, and other styles

21

Neumann, Stefan, and Holger Giese. "Scalable compatibility for embedded real-time components via language progressive timed automata." Universität Potsdam, 2013. http://opus.kobv.de/ubp/volltexte/2013/6385/.

Full text

Abstract:

The proper composition of independently developed components of an embedded real- time system is complicated due to the fact that besides the functional behavior also the non-functional properties and in particular the timing have to be compatible. Nowadays related compatibility problems have to be addressed in a cumbersome integration and configuration phase at the end of the development process, that in the worst case may fail. Therefore, a number of formal approaches have been developed, which try to guide the upfront decomposition of the embedded real-time system into components such that

APA, Harvard, Vancouver, ISO, and other styles

22

Abou, Trab Mohammad. "Software engineering : testing real-time embedded systems using timed automata based approaches." Thesis, Brunel University, 2012. http://bura.brunel.ac.uk/handle/2438/6611.

Full text

Abstract:

Real-time Embedded Systems (RTESs) have an increasing role in controlling society infrastructures that we use on a day-to-day basis. RTES behaviour is not based solely on the interactions it might have with its surrounding environment, but also on the timing requirements it induces. As a result, ensuring that an RTES behaves correctly is non-trivial, especially after adding time as a new dimension to the complexity of the testing process. This research addresses the problem of testing RTESs from Timed Automata (TA) specification by the following. First, a new Priority-based Approach (PA) for t

APA, Harvard, Vancouver, ISO, and other styles

23

Ericsson, Ann-Marie. "Verifying transformations between timed automata specifications and ECA rules." Thesis, University of Skövde, Department of Computer Science, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-823.

Full text

Abstract:

<p>Event-triggered real-time systems are desirable to use in environments where the arrival of events are hard to predict. The semantics of an event-triggered system is well mapped to the behaviour of an active database management system (ADBMS), specified using event-condition-action (ECA) rules. The benefits of using an active database, such as persistent data storage, concurrency control, timely response to event occurrences etc. highlights the need for a development method for event-triggered real-time systems using active databases.</p><p>However, there are problems left to be solved befo

APA, Harvard, Vancouver, ISO, and other styles

24

Ausmees, Kristiina. "Zone-Based Reachability Analysis of Dense-Timed Pushdown Automata." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-179802.

Full text

Abstract:

Proving that programs behave correctly is a matter of both great theoretical interest as well as practical use. One way to do this is by analyzing a model of the system in question in order to determine if it meets a given specification. Real-time recursive systems can be modeled by dense-timed pushdown automata, a model which combines the behaviours of classical timed automata and pushdown automata. The problem of reachability has been proven to be decidable for this model. The algorithm that solves this problem relies on constructing a classical pushdown automaton that mimics the behaviour o

APA, Harvard, Vancouver, ISO, and other styles

25

Herrera, Christian [Verfasser], and Andreas [Akademischer Betreuer] Podelski. "The class of timed automata with quasi-equal clocks." Freiburg : Universität, 2017. http://d-nb.info/1152944584/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Bourke, Timothy Peter Computer Science &amp Engineering Faculty of Engineering UNSW. "Modelling and programming embedded controllers with timed automata and synchronous languages." Awarded by:University of New South Wales. Computer Science & Engineering, 2009. http://handle.unsw.edu.au/1959.4/44746.

Full text

Abstract:

Embedded controllers coordinate the behaviours of specialised hardware components to satisfy broader application requirements. They are difficult to model and to program. One of the greatest challenges is to express intricate timing behaviours???which arise from the physical characteristics of components???while not precluding efficient implementations on resource-constrained platforms. Aspects of this challenge are addressed by this thesis through four distinct applications of timed automata and the synchronous languages Argos and Esterel. A novel framework for simulating controllers written

APA, Harvard, Vancouver, ISO, and other styles

27

Doyen, Laurent. "Algorithmic analysis of complex semantics for timed and hybrid automata." Doctoral thesis, Universite Libre de Bruxelles, 2006. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210853.

Full text

Abstract:

In the field of formal verification of real-time systems, major developments have been recorded in the last fifteen years. It is about logics, automata, process algebra, programming languages, etc. From the beginning, a formalism has played an important role: timed automata and their natural extension,hybrid automata. Those models allow the definition of real-time constraints using real-valued clocks, or more generally analog variables whose evolution is governed by differential equations. They generalize finite automata in that their semantics defines timed words where each symbol is associat

APA, Harvard, Vancouver, ISO, and other styles

28

Sproston, Jeremy James. "Model checking of probabilistic timed and hybrid systems." Thesis, University of Birmingham, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.391021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Larsson, Fredrik. "Efficient implementation of model-checkers for networks of timed automata." Licentiate thesis, Uppsala universitet, Avdelningen för datorteknik, 2000. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-226511.

Full text

Abstract:

Since real-time systems often operate in safety-critical environments it is extremely important that they function correctly. UPPAAL is a tool that can be used for validation and verification of real-time systems. The user models the system using networks of timed automata and uses a simple logic to express safety requirements that the modelled system must satisfy to guarantee its correct behaviour. UPPAAL then performs reachability analysis using constraint solving techniques to check if the model satisfies the given requirements. In addition, the tool is also able to provide the user with a

APA, Harvard, Vancouver, ISO, and other styles

30

Troina, Angelo [Verfasser]. "Probabilistic Timed Automata for Security Analysis and Design / Angelo Troina." Munich : GRIN Publishing, 2017. http://d-nb.info/1138030554/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Ramparison, Mathias. "On the theory and practice of updatable parametric timed automata." Thesis, Paris 13, 2019. http://www.theses.fr/2019PA131063.

Full text

Abstract:

A mesure que les systèmes cyber-physiques deviennent de plus en plus complexes,le débogage humain ne suffit plus pour analyser le grand nombre de comportements possibles. Pour les systèmes critiques coûteux où des vies humaines peuvent être mise sen danger, il est encore plus crucial de prouver formellement la sécurité d'un système.Pour ce faire, on définit une spécification formelle pour le système, puis on vérifie algorithmiquement que le système satisfait à certaines propriétés spécifiées de manière formelle. Avec cette description précise et exhaustive d'un système, le ou habituel du langa

APA, Harvard, Vancouver, ISO, and other styles

32

M'Hemdi, Hana. "Contributions à la génération de tests à partir d'automates à pile temporisés." Thesis, Besançon, 2016. http://www.theses.fr/2016BESA2050/document.

Full text

Abstract:

La vérification et la validation des composants logiciels des systèmes temps réel est un des enjeuxmajeurs pour le développement de systèmes automatisés. Les modèles de tels systèmes doiventêtre vérifiés, et la conformité de leur implémentation par rapport à leur modèle doit être validée. Nous nous plaçons dans le cadre des systèmes récursifs temps réels modélisables par des automates à pile temporisés avec deadlines (TPAIO). Les deadlines imposent des conditions de progression du temps. L’objectif de cette thèse est de proposer des méthodes de génération de tests pour les TPAIO.Nos contributi

APA, Harvard, Vancouver, ISO, and other styles

33

Gani, Kahina. "Using timed automata formalism for modeling and analyzing home care plans." Thesis, Clermont-Ferrand 2, 2015. http://www.theses.fr/2015CLF22628/document.

Full text

Abstract:

Dans cette thèse nous nous sommes intéressés aux problèmes concernant la conception et la gestion des plans de soins à domicile. Un plan de soins à domicile définit l'ensemble des activités médicales et/ou sociales qui sont menées jour après jour au domicile d'un patient. Ce plan de soins est généralement construit à travers un processus complexe impliquant une évaluation complète des besoins du patient ainsi que son environnement social et physique. La spécification de plans de soins à domicile est difficile pour plusieurs raisons: les plans de soins à domicile sont par nature des processus n

APA, Harvard, Vancouver, ISO, and other styles

34

Basset, Nicolas. "Volumetry of timed languages and applications." Thesis, Paris Est, 2013. http://www.theses.fr/2013PEST1073/document.

Full text

Abstract:

Depuis le début des années 90, les automates temporisés et les langages temporisés ont été largement utilisés pour modéliser et vérifier les systèmes temps réels. Ces langages ont été aussi été largement étudiés d'un point de vue théorique. Plus récemment Asarin et Degorre ont introduit les notions de volume et d'entropie des langages temporisés pour quantifier la taille de ces langages et l'information que ses éléments contiennent. Dans cette thèse nous construisons de nouveaux développements à cette théorie (que nous appelons volumétrie des langages temporisés) et l'appliquons a plusieurs pr

APA, Harvard, Vancouver, ISO, and other styles

35

Busatto-Gaston, Damien. "Symbolic controller synthesis for timed systems : robustness and optimality." Electronic Thesis or Diss., Aix-Marseille, 2019. http://www.theses.fr/2019AIXM0461.

Full text

Abstract:

Le domaine de la synthèse réactive a pour objectif d'obtenir un système correct par construction à partir d'une spécification logique.Une approche classique consiste à se ramener à un jeu à somme nulle,où deux joueurs interagissent tour-à-tour dans un système de transitions, et à se demander si le joueur "contrôleur" peut garantir que son objectif sera rempli, et ce indépendamment des décisions du joueur "environnement".Nous étudions des spécifications temps-réel, modélisées par un automate temporisé équipé d'un objectif d'accessibilité ou de Büchi, et présentons des méthodes symboliques pour

APA, Harvard, Vancouver, ISO, and other styles

36

Ciatto, Giovanni. "Third generation neural networks: formalization as timed automata, validation and learning." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/12947/.

Full text

Abstract:

Questa tesi mostra una formalizzazione delle reti neurali spiking ottenuta tramite automi temporizzati. Tali reti, a differenza di quelle di seconda generazione, tengono conto anche della dimensione temporale. Sono mostrate due codifiche, sincrona e asincrona, del modello "leaky integrate and fire": i neuroni sono modellati come automi temporizzati che attendono impulsi su dei canali di ingresso e aggiornano il potenziale in base agli input presenti e passati, modulati dai pesi delle rispettive sinapsi e tanto più influenti quanto più recenti. Se il potenziale supera una certa soglia, l'automa

APA, Harvard, Vancouver, ISO, and other styles

37

Lim, Hongping. "Translating timed I/O automata specifications for theorem proving in PVs." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36803.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.<br>Includes bibliographical references (leaves 68-70).<br>The timed input/output automaton modeling framework is a mathematical framework for specification and analysis of systems that involve discrete and continuous evolution. In order to employ an interactive theorem prover in deducing properties of a timed input/output automaton, its state-transition based description has to be translated to the language of the theorem prover. This thesis describes a tool for translating from

APA, Harvard, Vancouver, ISO, and other styles

38

Krause, Christian, and Holger Giese. "Quantitative modeling and analysis of service-oriented real-time systems using interval probabilistic timed automata." Universität Potsdam, 2012. http://opus.kobv.de/ubp/volltexte/2012/5784/.

Full text

Abstract:

One of the key challenges in service-oriented systems engineering is the prediction and assurance of non-functional properties, such as the reliability and the availability of composite interorganizational services. Such systems are often characterized by a variety of inherent uncertainties, which must be addressed in the modeling and the analysis approach. The different relevant types of uncertainties can be categorized into (1) epistemic uncertainties due to incomplete knowledge and (2) randomization as explicitly used in protocols or as a result of physical processes. In this report, we stu

APA, Harvard, Vancouver, ISO, and other styles

39

Perevoshchikov, Vitaly. "Multi-weighted Automata Models and Quantitative Logics." Doctoral thesis, Universitätsbibliothek Leipzig, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-166142.

Full text

Abstract:

Recently, multi-priced timed automata have received much attention for real-time systems. These automata extend priced timed automata by featuring several price parameters. This permits to compute objectives like the optimal ratio between rewards and costs. Arising from the model of timed automata, the multi-weighted setting has also attracted much notice for classical nondeterministic automata. The present thesis develops multi-weighted MSO-logics on finite, infinite and timed words which are expressively equivalent to multi-weighted automata, and studies decision problems for them. In addi

APA, Harvard, Vancouver, ISO, and other styles

40

Muhajab, Hanan Nasser. "EXTENDED COUPLED PROBABLISTIC TIMED AUTOMATA FOR MONITORING EATING ACTIVITIES OF ELDERLY PERSON." Kent State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=kent1479812233555067.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Hatvani, Leo. "Formal Verification of Adaptive Real-Time Systems by Extending Task Automata." Licentiate thesis, Mälardalens högskola, Inbyggda system, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-26129.

Full text

Abstract:

Recently, we have seen an increase in the deployment of safety critical embedded systems in rapidly changing environments, as well as requirement for on-site customizations and rapid adaptation. To address the extended range of requirements, adaptation mechanism are added to the systems to handle large number of situations appropriately. Although necessary, adaptations can cause inconsistent and unstable configurations that must be prevented for the embedded system to remain dependable and safe. Therefore, verifying the behavior of adaptive embedded systems during the design phase of the produ

APA, Harvard, Vancouver, ISO, and other styles

42

Rinast, Jonas [Verfasser], and Sibylle [Akademischer Betreuer] Schupp. "An online model-checking framework for timed automata / Jonas Rinast. Betreuer: Sibylle Schupp." Hamburg : Universitätsbibliothek der Technischen Universität Hamburg-Harburg, 2015. http://d-nb.info/1077042043/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Suryadevara, Jagadish. "Model Based Development of Embedded Systems using Logical Clock Constraints and Timed Automata." Doctoral thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-22328.

Full text

Abstract:

In modern times, human life is intrinsically depending on real-time embedded systems (RTES) with increasingly safety-critical and mission-critical features, for instance, in domains such as automotive and avionics. These systems are characterized by stringent functional requirements and require predictable timing behavior. However, the complexity of RTES has been ever increasing requiring systematic development methods. To address these concerns, model-based frameworks and component-based design methodologies have emerged as a feasible solution. Further, system artifacts such as requirements/s

APA, Harvard, Vancouver, ISO, and other styles

44

Rinast, Jonas Verfasser], and Sibylle [Akademischer Betreuer] [Schupp. "An online model-checking framework for timed automata / Jonas Rinast. Betreuer: Sibylle Schupp." Hamburg : Universitätsbibliothek der Technischen Universität Hamburg-Harburg, 2015. http://nbn-resolving.de/urn:nbn:de:gbv:830-88213142.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Jaziri, Samy. "Automate sur les structures temporisée." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLN039/document.

Full text

Abstract:

Les systèmes digitaux jouent un rôle croissant dans le bon fonctionnement de notre société.Au delà de la grande diversité de leur domaines d'utilisations, on confie aujourd'hui destâches importantes à des algorithmes. Déjà largement utilisés dans des domaines aussi délicatque le transport, la chirurgie ou l'économie, il est aujourd'hui de plus en plus question defaire de la place aux systèmes digitaux dans les domaines sociaux et politiques :vote électronique, algorithmes de sélection, profilage électoraldotsPour les tâches confiées à des algorithmes, la responsabilité est déplacées de l'exécu

APA, Harvard, Vancouver, ISO, and other styles

46

Jenkins, Mark Daniel. "Synthesis and alternating automata over real time." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:f37ccc5f-8ed6-4b00-b9e3-28c4bb4ec60a.

Full text

Abstract:

Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, in providing verification algorithms for prominent specification formalisms such as Metric Temporal Logic. Unfortunately, when interpreted over an infinite dense time domain (such as the reals), alternating timed automata have an undecidable language emptiness problem. In this thesis we consider restrictions on this model that restore the decidability of the language emptiness problem. We consider the restricted class

APA, Harvard, Vancouver, ISO, and other styles

47

Bundala, Daniel. "Algorithmic verification problems in automata-theoretic settings." Thesis, University of Oxford, 2014. https://ora.ox.ac.uk/objects/uuid:60b2d507-153f-4119-a888-56ccd47c3752.

Full text

Abstract:

Problems in formal verification are often stated in terms of finite automata and extensions thereof. In this thesis we investigate several such algorithmic problems. In the first part of the thesis we develop a theory of completeness thresholds in Bounded Model Checking. A completeness threshold for a given model M and a specification φ is a bound k such that, if no counterexample to φ of length k or less can be found in M, then M in fact satisfies φ. We settle a problem of Kroening et al. [KOS<sup>+</sup>11] in the affirmative, by showing that the linearity problem for both regula

APA, Harvard, Vancouver, ISO, and other styles

48

Luukkainen, Matti. "A process algebraic reduction strategy for automata theoretic verification of untimed and timed concurrent systems." Helsinki : University of Helsinki, 2003. http://ethesis.helsinki.fi/julkaisut/mat/tieto/vk/luukkainen/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Schmidt, Jana A. [Verfasser], Burkhard [Akademischer Betreuer] Rost, and Stefan [Akademischer Betreuer] Kramer. "Machine Learning of Timed Automata / Jana A. Schmidt. Gutachter: Burkhard Rost ; Stefan Kramer. Betreuer: Burkhard Rost." München : Universitätsbibliothek der TU München, 2013. http://d-nb.info/1046404865/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Gerke, Michael [Verfasser]. "Modeling and verifying the FlexRay physical layer protocol with reachability checking of timed automata / Michael Gerke." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2020. http://d-nb.info/1229436014/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!