Dissertations / Theses on the topic 'Temporal logic'
To see the other types of publications on this topic, follow the link: Temporal logic.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Temporal logic.'
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
Sack, Joshua. "Adding temporal logic to dynamic epistemic logic." [Bloomington, Ind.] : Indiana University, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3274928.
Full textAbstract:
Thesis (Ph.D.)--Indiana University, Dept. of Mathematics, 2007.Source: Dissertation Abstracts International, Volume: 68-07, Section: B, page: 4531. Adviser: Lawrence Moss. Title from dissertation home page (viewed Apr. 22, 2008).
2
Gustafsson, Joakim. "Extending temporal action logic /." Linköping : Univ, 2001. http://www.bibl.liu.se/liupubl/disp/disp2001/tek689s.pdf.
Full text
3
Hale, Roger William Stephen. "Programming in temporal logic." Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305467.
Full text
4
Oberholzer, Johannes Francois. "Agent Interval Temporal Logic." Diss., University of Pretoria, 2020. http://hdl.handle.net/2263/74826.
Full textAbstract:
Alternating-Time Temporal Logic (ATL), introduced by Alur, Henzinger and
Kupferman, is a logic involving coalitions of agents performing actions which cause
a state change in a turn-based time system. There have been game theoretic ex-
tensions on ATL, and they are very good at specifying systems of multiple agents
cooperating or competing in a game-like situation. Unfortunately neither ATL nor
its extensions are able to capture the idea of gradual change, or duration of actions
or events. The concurrent game model of ATL operates like a turn based game,
with sets of agents taking their turn, and then the environment changing based
on their actions, before they take their next turn. The fact that some actions
take longer than others, or that sometimes a state changes gradually, rather than
immediately, is not representable in ATL. As an example, take a train entering
a tunnel. Before the train enters the tunnel, it is outside the tunnel, after it has
entered the tunnel, it is inside the tunnel, but for the few seconds it takes the
train to enter the tunnel, it is neither inside nor outside the tunnel. ATL cannot
represent this basic intuitive truth.
A family of logics called Interval Logic (IL) use finite state sequences called
“intervals”, which allow it to describe a more continuous model of time, rather
than a discrete state based one such as ATL. This allows it to capture the idea of
gradual change, of a train entering a tunnel, and the fact that actions and events
have various durations. Most of the IL formulations do however not have any way
of distinguishing multiple agents acting at the same time.
Both of these logics - ATL and IL - are useful for specific things, but combining
them might produce new applications which are not possible when only using the
one or the other. In this dissertation we present one such possible combination,
called Agent Interval Temporal Logic (AITL). AITL combines the notion of agents,
coalitions and strategies from ATL with the interval based model of time from IL,
thus creating a new logic which might have some powerful applications in a wide
range of areas in which gradual change and multiple agents acting at the same
time can both be accommodated.Dissertation (MA)--University of Pretoria, 2020.
Centre for Artificial Intelligence Research at CSIR
Philosophy
MA
Unrestricted
5
Duan, Zhenhua. "An extended interval temporal logic and a framing technique for temporal logic programming." Thesis, University of Newcastle Upon Tyne, 1996. http://hdl.handle.net/10443/2075.
Full textAbstract:
Temporal logic programming is a paradigm for specification and verification of concurrent programs in which a program can be written, and the properties of the program can be described and verified in a same notation. However, there are many aspects of programming in temporal logics that are not well-understood. One such an aspect is concurrent programming, another is framing and the third is synchronous communication for parallel processes. This thesis extends the original Interval Temporal Logic (ITL) to include infinite models, past operators, and a new projection operator for dealing with concurrent computation, synchronous communication, and framing in the context of temporal logic programming. The thesis generalizes the original ITL to include past operators such as previous and past chop, and extends the model to include infinite intervals. A considerable collection of logic laws regarding both propositional and first order logics is formalized and proved within model theory. After that, a subset of the extended ITL is formalized as a programming language, called extended Tempura. These extensions, as in their logic basis, include infinite models, the previous operator, projection and framing constructs. A normal form for programs within the extended Tempura is demonstrated. Next, a new projection operator is introduced. In the new construct, the sub-processes are autonomous; each process has the right to specify its own interval over which it is executed. The thesis presents a framing technique for temporal logic programming, which includes the definitions of new assignments, the assignment flag and the framing operator, the formalization of algebraic properties of the framing operator, the minimal model semantics of framed programs, as well as an executable framed interpreter. The synchronous communication operator await is based directly on the proposed framing technique. It enables us to deal with concurrent computation. Based on EITL and await operator, a framed concurrent temporal logic programming language, FTLL, is formally defined within EITL. Finally, the thesis describes a framed interpreter for the extended Tempura which has been developed in SICSTUS prolog. In the new interpreter, the implementation of new assignments, the frame operator, the await operator, and the new projection operator are all included.
6
Boretti, B. "Proof Analysis in Temporal Logic." Doctoral thesis, Università degli Studi di Milano, 2009. http://hdl.handle.net/2434/64477.
Full textAbstract:
The logic of time is one of the most interesting modal logics, and its importance is widely acknowledged both for philosophical and formal reasons.
In this thesis, we apply the method of internalisation of Kripke-style semantics into the syntax of sequent calculus to the proof-theoretical analysis of temporal logics.
Sequent systems for different flows of time are obtained as modular extensions of a basic temporal calculus, through the addition of appropriate mathematical rules that correspond to the properties of temporal frames: a general and uniform treatment is thus achieved for a wide range of temporal logics. All the calculi enjoy remarkable structural properties, in particular are contraction and cut free.
Linear discrete time is analysed by means of two infinitary calculi. The first is obtained by means of a rule with infinitely many premises, and the second through a new definition of provability which admits, under certain conditions, derivation trees with infinite branches.
The first calculus enjoys the desired structural properties, but the presence of an infinitary rule is harmful for proof analysis. Two finitary systems are identified by replacing the infinitary rule with a weaker finitary rule, and by bounding the number of its premises, respectively. Corresponding, somehow complementary, conservativity results are proved with respect to adequate fragments of the original calculus.
The second calculus stems from a closure algorithm which exploits the fixed-point equations
for temporal operators and gives saturated sets of closure formulas from a given formula.
Finitisation is obtained in the form of an upper bound to the proof-search procedure, and decidability follows as a major consequence.
7
Weidner, Thomas. "Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic." Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208732.
Full textAbstract:
The classic theorems of Büchi and Kleene state the expressive equivalence of finite automata to monadic second order logic and regular expressions, respectively. These fundamental results enjoy applications in nearly every field of theoretical computer science. Around the same time as Büchi and Kleene, Rabin investigated probabilistic finite automata. This equally well established model has applications ranging from natural language processing to probabilistic model checking.
Here, we give probabilistic extensions Büchi\\\'s theorem and Kleene\\\'s theorem to the probabilistic setting. We obtain a probabilistic MSO logic by adding an expected second order quantifier. In the scope of this quantifier, membership is determined by a Bernoulli process. This approach turns out to be universal and is applicable for finite and infinite words as well as for finite trees. In order to prove the expressive equivalence of this probabilistic MSO logic to probabilistic automata, we show a Nivat-theorem, which decomposes a recognisable function into a regular language, homomorphisms, and a probability measure.
For regular expressions, we build upon existing work to obtain probabilistic regular expressions on finite and infinite words. We show the expressive equivalence between these expressions and probabilistic Muller-automata. To handle Muller-acceptance conditions, we give a new construction from probabilistic regular expressions to Muller-automata. Concerning finite trees, we define probabilistic regular tree expressions using a new iteration operator, called infinity-iteration. Again, we show that these expressions are expressively equivalent to probabilistic tree automata.
On a second track of our research we investigate Constraint LTL over multidimensional data words with data values from the infinite tree. Such LTL formulas are evaluated over infinite words, where every position possesses several data values from the infinite tree. Within Constraint LTL on can compare these values from different positions. We show that the model checking problem for this logic is PSPACE-complete via investigating the emptiness problem of Constraint Büchi automata.
8
Lambiri, Cristian. "Temporal logic models for distributed systems." Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/10056.
Full textAbstract:
Since the beginning of the 1980's, the way the computer systems are conceived has changed dramatically. This is a direct result of the appearance, on a large scale, of personal computers and engineering workstations. As a result, networks of independent systems have appeared. This thesis presents a formal specification framework that can be used in the design of distributed systems. The abstract models that are presented are based on a systemic view of distributed systems and discrete event systems. Two base abstract models called deterministic discrete event systems (DDES) and discrete event automaton (DEA) are presented. For the DEA the series and parallel compositions as well as feedback connection are defined. Universal algebra is employed to study the parallel composition of DEAs. From the DDES/DEA an abstract model for distributed systems is obtained. Subsequently, linear time temporal logic is modified for use with the abstract chosen model of distributed systems. The logic is described in three aspects: syntax, semantics and axiomatics. The syntax is modified by the addition of two operators. The semantics of the logic is given over the abstract models. Five axioms are added to the axiomatic system for the two new operators. A programming language called TLL, based on the theoretical framework, links the theory with practice. The syntax and semantics of the programming language are presented. Finally an example of modeling in the framework is given.
9
Lacey, D. J. "Program transformation using temporal logic specifications." Thesis, University of Oxford, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.289278.
Full text
10
Karaman, Sertac. "Optimal planning with temporal logic specifications." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/50573.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2009.Includes bibliographical references (p. 117-121).
Most of the current uninhabitated Aerial Vehicles (UAVs) are individually monitored, commanded and controlled by several operators of different expertise. However, looking forward, there has been a recent interest in multiple-UAV systems, in which the system is only provided with the high-level goals and constraints, called the "mission specifications," and asked to navigate the UAVs such that the mission specifications are fulfilled. A crucial part in designing such multiple-UAV systems is the development of coordination and planning algorithms that, given a set of high-level mission specifications as input, can synthesize provably correct and possibly optimal schedules for each of the UAVs. This thesis studies optimal planning problems in a multiple-UAV mission planning setting, where the mission specifications are given in formal languages. The problem is posed as a novel variant of the Vehicle Routing Problem (VRP), in which temporal logics and process algebra are utilized to represent a large class of mission specifications in a systematic way. The thesis is structured in two parts. In the first part, two temporal logics that are remarkably close to the natural language, namely the linear temporal logic LTL-x and the metric temporal logic (MTL), are considered for specification of a large class of temporal and logical constraints in VRPs. Mixed-integer linear programming based algorithms, which solve these variants of the VRP to optimality, are presented. In the second part, process algebra is introduced and used as a candidate for the same purpose.
(cont.) A tree search based anytime algorithm is given; this algorithm is guarranteed to find a best-first feasible solution in polynomial time and improve it to an optimal one in finite time.
by Sertac Karaman.
S.M.
11
Brochenin, Rémi. "Separation logic : expressiveness, complexity, temporal extension." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2013. http://tel.archives-ouvertes.fr/tel-00956587.
Full textAbstract:
This thesis studies logics which express properties on programs. These logics were originally intended for the formal verification of programs with pointers. Overall, no automated verification method will be proved tractable here- rather, we give a new insight on separation logic. The complexity and decidability of some essential fragments of this logic for Hoare triples were not known before this work. Also, its combination with some other verification methods was little studied. Firstly, in this work we isolate the operator of separation logic which makes it undecidable. We describe the expressive power of this logic, comparing it to second-order logics. Secondly, we try to extend decidable subsets of separation logic with a temporal logic, and with the ability to describe data. This allows us to give boundaries to the use of separation logic. In particular, we give boundaries to the creation of decidable logics using this logic combined with a temporal logic or with the ability to describe data.
12
Reddy, Pamoori Venkateswara. "Tableau systems for tense logics : a constraint approach." Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.283438.
Full text
13
Zappe, Julia. "Towards a Mobile Temporal Logic of Actions." Diss., lmu, 2005. http://nbn-resolving.de/urn:nbn:de:bvb:19-52039.
Full text
14
Tanabe, Makoto. "Timed Petri Nets and Temporal Linear Logic." 京都大学 (Kyoto University), 1999. http://hdl.handle.net/2433/181934.
Full text
15
Den, Heyer Molly. "The development of a Temporal Logic Model." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ58333.pdf.
Full text
16
Bolotov, Alexander. "Clausal resolution for branching-time temporal logic." Thesis, Manchester Metropolitan University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.311209.
Full text
17
Marshall, I. "Hardware synthesis from an interval temporal logic." Thesis, University of East Anglia, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361488.
Full text
18
Ulusoy, M. Alphan. "Optimal temporal logic control of autonomous vehicles." Thesis, Boston University, 2014. https://hdl.handle.net/2144/12242.
Full textAbstract:
Thesis (Ph.D.)--Boston UniversityTemporal logics, such as Linear Temporal Logic (LTL) and Computation Tree Logic (CTL), are extensions of propositional logic that can capture temporal relations. Even though temporal logics have been used in model checking of finite systems for quite some time, they have gained popularity as a means for specifying complex mission requirements in path planning and control synthesis problems only recently. This dissertation proposes and evaluates methods and algorithms for optimal path planning and control synthesis for autonomous vehicles where a high-level mission specification expressed in LTL (or a fragment of LTL) must be satisfied. In summary, after obtaining a discrete representation of the overall system, ideas and tools from formal verification and graph theory are leveraged to synthesize provably correct and optimal control strategies. The first part of this dissertation focuses on automatic planning of optimal paths for a group of robots that must satisfy a common high level mission specification. The effect of slight deviations in traveling times on the behavior of the team is analyzed and methods that are robust to bounded non-determinism in traveling times are proposed. The second part focuses on the case where a controllable agent is required to satisfy a high-level mission specification in the presence of other probabilistic agents that cannot be controlled. Efficient methods to synthesize control policies that maximize the probability of satisfaction of the mission specification are presented. The focus of the third part is the problem where an autonomous vehicle is required to satisfy a rich mission specification over service requests occurring at the regions of a partitioned environment. A receding horizon control strategy that makes use of the local information provided by the sensors on the vehicle in addition to the a priori information about the environment is presented. For all of the automatic planning and control synthesis problems that are considered, the proposed algorithms are implemented, evaluated, and validated through experiments and/or simulations.
19
Singh, Akash. "Platoon Coordination under Signal Temporal Logic Specifications." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-286830.
Full textAbstract:
Autonomous Driving has been hailed as one of the biggest game-changers for solving a lots of problems of the future, such as traffic congestion, efficiency of transportation, carbon emissions, road safety etc. Vehicle platooning has been a well studied idea in this field for efficient highway driving, which has been around since a few decades now. This work aims at planning for tasks that will be undertaken by an autonomous vehicle in a computationally efficient manner instead of usual methods that are calculation heavy, like MPC, and present how they can enable the vehicle to move around highway on its own or in coordination with a platoon. Using computationally simple planners leaves enough bandwidth for processors to look for unprecedented changes in a dynamic environment. The major contribution of this thesis is in demonstrating the formulation of specification for such tasks in a dynamic and heterogeneous environment using Signal Temporal Logic (STL). Control Barrier Functions (CBF) are then used to represent them as constraints for the system which are in turn fulfilled by a quadratic optimization-based controller. The STL definition allows more insight into planning for the system from a time-based perspective, while employing CBFs as constraints guarantees the system never leaves its specified set of safe states. Two different maneuvers, namely lane changing and overtaking-merging with a platoon, are performed. The merging task also demonstrates cooperation between vehicles using the same method, which shows its suitability for platoon coordination tasks. These results are presented from a computer based simulation which, along with the system and controller, also models different traffic behaviours. Particularly, the average speed of the traffic and the traffic density are modelled to verify the suitability of the controller in varying conditions and understand its limits. Also, experiments with real robots were performed in laboratory environment, which were done with the single-integrator holonomic vehicle model to assess the feasibility of the method in real world.Autonom körning har hyllats en av de största spelväxlarna för att lösa många framtidsproblem, såsom trafikstockningar, effektivitet i transporter, koldioxidutsläpp, trafiksäkerhet etc. En Kolonn har varit en väl studerad idé inom detta område för en effektiv motorvägskörning, som har funnits sedan några decennier nu. Detta arbete syftar till att planera för uppgifter som kommer att utföras av ett autonomt fordon på ett beräkningseffektivt sätt, istället för vanliga beräkningsmetoder som MPC, och presentera hur de kan göra det möjligt för fordonet att röra sig på motorvägen på egen hand eller i samordning med en kolonn. Användning av beräkningsenligt planerare lämnar tillräckligt med bandbredd för att processorer ska kunna leta efter aldrig tidigare skådade förändringar i en dynamisk miljö. Det viktigaste bidraget med denna avhandling är att demonstrera formuleringen av specifikation för sådana uppgifter i en dynamisk och heterogen miljö med hjälp av Signal Temporal Logic (STL). Control Barrier Functions (CBF) används sedan för att representera dem som begränsningar för systemet som i sin tur uppfylls av en kvadratisk optimeringsbaserad styrenhet. STL-definitionerna möjliggör mer insikt i planering av systemet ur ett tidsbaserat perspektiv, medan användning av CBF som begränsningar garanterar att systemet aldrig lämnar sin specificerade uppsättning säkra tillstånd. Två olika manövrar, nämligen körbyte och omkörning-sammanslagning med en kolonn, utförs. Den sammanslagna uppgiften visar också samarbete mellan fordon med samma metod, vilket visar att det är lämpligt för samordning av plutoner. Dessa resultat presenteras från en datorbaserad simulering, som tillsammans med systemet och styrenheten också modellerar olika trafikbeteenden. Särskilt modelleras trafikens genomsnittliga hastighet och trafiktätheten för att verifiera styrenhetens lämplighet och förstå dess gränser. Experiment med riktiga robotar utfördes också i laboratoriemiljö, som gjordes med en integrerad holonomisk fordonsmodell för att bedöma metodens genomförbarhet i den verkliga världen.
20
Gallina, Francesco. "Future Contingents. Indeterminism, Temporal Logic and Semantics." Doctoral thesis, Università degli studi di Padova, 2017. http://hdl.handle.net/11577/3425722.
Full textAbstract:
This essay is about the problem of future contingents, that is, statements predicting future events that are neither historically impossible, nor inevitable. The analysis intersects metaphysics, logic, philosophy of language and philosophy of science. In particular, the essay explores why indeterminism – viz., the doctrine that the present, the past, and the laws of nature do not necessitate the future – may be taken as a sensible thesis. Furthermore, several semantics for indeterministic, modal temporal languages will be considered. It is argued that the modal, temporal logic that best fits indeterminism is a version that mirrors the so-called TRL metaphysics. The advocates of the TRL metaphysics, indeed, can evoke a substantive notion of actuality to tell themselves apart from determinist, many worlds theorists. And the notion of substantive actuality assumed by TRL theorists may be easily reflected at the (post)semantic level, yield- ing a temporal logic which meets several desiderata.Il saggio affronta il problema dei futuri contingenti, ovvero di quegli enunciati che predicono eventi futuri nè storicamente impossibili, nè inevitabili. L'analisi interseca la metafisica, la logica, la filosofia del linguaggio e la filosofia della scienza. In particolare, nel saggio si avanzano ragioni per ritenere che l'indeterminismo - la tesi secondo cui il presente e il passato, insieme alle leggi di natura, non necessitano il futuro - sia plausibile. Si analizzano diverse semantiche per linguaggi tempo-modali, argomentando che la logica tempo-modale che meglio si adatta all'indeterminismo è una variante della così detta metafisica TRL. I sostenitori della metafisica TRL, infatti, possono evocare una nozione di attualità sostanziale per distinguersi da altre forme di determinismo a molti mondi. La nozione di attualità sostantiva può inoltre essere facilmente riflessa in semantica, generando una logica temporale che soddisfa diversi desiderata.
21
Bauer, Sebastian. "Algorithmische Eigenschaften von Branching-Time Logiken." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2007. http://nbn-resolving.de/urn:nbn:de:swb:14-1168770883767-64981.
Full textAbstract:
Es wird die Axiomatisierbarkeit einer Klasse von temporalen Prädikatenlogiken über verzweigenden Strukturen gezeigt. Entscheidbarkeitsresultate folgen für diverse Fragmente dieser Logiken. Anwendungen werden diskutiert.
22
Bauer, Sebastian. "Algorithmische Eigenschaften von Branching-Time Logiken." Doctoral thesis, Technische Universität Dresden, 2005. https://tud.qucosa.de/id/qucosa%3A24981.
Full textAbstract:
Es wird die Axiomatisierbarkeit einer Klasse von temporalen Prädikatenlogiken über verzweigenden Strukturen gezeigt. Entscheidbarkeitsresultate folgen für diverse Fragmente dieser Logiken. Anwendungen werden diskutiert.
23
Müller, Daniel. "Trajectory Generation under Metric Interval Temporal Logic Specifications." Thesis, KTH, Reglerteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-217122.
Full textAbstract:
Metric interval temporal logic (MITL) provides a tool to formulate high level tasks in an easyway. This allows to specify behaviour of a dynamical system in a given environment which liesbeyond the scope of simple stabilization. Finding an input of the system which satises the MITLformula, demands new techniques and algorithms. In this thesis, a novel approach is presented whichabstracts the dynamical system into a time optimal weighted transition system (WTS) and convertsthe MITL formula into a Timed Buchi Automaton (TBA). From the graph product of the WTS andTBA a sequence of environment states together with time constraints is obtained. Together with auser specied cost function, the sequence is translated into an optimization problem. The solutionof this nal optimization problem satises the MITL formula for the dynamical system in the givenenvironment and is obtained by using methods from optimal control.Metric interval temporal logic (MITL) ger ett verktyg för att formulera uppgifter på hög nivåpå ett enkelt sätt. Detta gör det möjligt att specificera beteendet hos ett dynamiskt system i engiven miljö som ligger utanför ramen för enkel stabilisering. Att hitta en insignal till systemet somuppfyller MITL-formeln kräver nya tekniker och algoritmer. I denna avhandling presenteras ett nytttillvägagångssätt som abstraherar det dynamiska systemet till ett tidsoptimerat weighted transitionsystem (WTS) och omvandlar MITL-formeln till en Timed Büchi Automaton (TBA). Frångrafprodukten av WTS och TBA erhålls en sekvens av sakens tillstånd tillsammans med tidsbegränsningar. Tillsammans med en användardefinierad kostnadsfunktion är sekvensen översatt till ettoptimeringsproblem. Lösningen av det här slutliga optimeringsproblemet uppfyller MITL-formelnför det dynamiska systemet i den givna miljön och erhålls genom att använda metoder från optimalkontroll.
24
Harvey, Randall A. "Verification of concurrent system specifications using temporal logic." Thesis, University of Ottawa (Canada), 1989. http://hdl.handle.net/10393/5662.
Full text
25
Kvarnström, Jonas. "TALplanner and other extensions to Temporal Action Logic /." Linköping : Dept. of Computer and Information Science, Univ, 2005. http://www.bibl.liu.se/liupubl/disp/disp2005/tek937s.pdf.
Full text
26
Jin, S. "Temporal logic specification and verification of communication protocols." Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.378819.
Full text
27
Zhao, Guoxing. "A complete reified temporal logic and its applications." Thesis, University of Greenwich, 2008. http://gala.gre.ac.uk/8200/.
Full textAbstract:
Temporal representation and reasoning plays a fundamental and increasingly important role in some areas of Computer Science and Artificial Intelligence. A natural approach to represent and reason about time-dependent knowledge is to associate them with instantaneous time points and/or durative time intervals. In particular, there are various ways to use logic formalisms for temporal knowledge representation and reasoning. Based on the chosen logic frameworks, temporal theories can be classified into modal logic approaches (including prepositional modal logic approaches and hybrid logic approaches) and predicate logic approaches (including temporal argument methods and temporal reification methods). Generally speaking, the predicate logic approaches are more expressive than the modal logic approaches and among predicate logic approaches, temporal reification methods are even more expressive for representing and reasoning about general temporal knowledge. However, the current reified temporal logics are so complicate that each of them either do not have a clear definition of its syntax and semantics or do not have a sound and complete axiomatization. In this thesis, a new complete reified temporal logic (CRTL) is introduced which has a clear syntax, semantics, and a complete axiomatic system by inheriting from the initial first order language. This is the main improvement made to the reification approaches for temporal representation and reasoning. It is a true reified logic since some meta-predicates are formally defined that allow one to predicate and quantify over prepositional terms, and therefore provides the expressive power to represent and reason about both temporal and non-temporal relationships between prepositional terms. For a special case, the temporal model of the simplified CRTL system (SCRTL) is defined as scenarios and graphically represented in terms of a directed, partially weighted or attributed, simple graph. Therefore, the problem of matching temporal scenarios is transformed into conventional graph matching. For the scenario graph matching problem, the traditional eigen-decomposition graph matching algorithm and the symmetric polynomial transform graph matching algorithm are critically examined and improved as two new algorithms named meta-basis graph matching algorithm and sort based graph matching algorithm respectively, where the meta-basis graph matching algorithm works better for 0-1 matrices while the sort based graph matching algorithm is more suitable for continuous real matrices. Another important contribution is the node similarity graph matching framework proposed in this thesis, based on which the node similarity graph matching algorithms can be defined, analyzed and extended uniformly. We prove that that all these node similarity graph matching algorithms fail to work for matching circles.
28
Leo, Jared. "Capturing temporal aspects of bio-health ontologies." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/capturing-temporal-aspects-of-biohealth-ontologies(a2f5868e-94e3-4d4b-bd1e-311358ebf7e0).html.
Full textAbstract:
Extending Descriptions Logics (DLs) with a temporal dimension to aid in the ability to model meaningful temporal information is an active and popular research area that has gathered a lot of attention over recent years. DLs underpin the Web Ontology Language (OWL) which offers a way to describe ontologies for the semantic web. Representing temporal information in ontologies plays an important role, specifically for those ontologies where time information is inherently embedded in the information they describe. This is very common for ontologies in the bio-health domain, for example ontologies that describe the development of anatomies of biological entities, stage based development, evolution of diseases and so on. As expressive as DLs are, given that they are fragments of First Order Logic, they are static in nature and are limited in what they can express from a temporal view point, hence the surge in temporal extensions to DLs over recent years. In this thesis we investigate the use of temporal extensions of DLs as suitable representations for the temporal information required for bio-health ontologies. We first set out to find out exactly what types of temporal information need to be modelled, before going on to evaluate current temporal extensions and representations to determine their suitability. We then go on to introduce several new temporal extensions to DLs and evaluate their suitability.
29
Thost, Veronika. "Using Ontology-Based Data Access to Enable Context Recognition in the Presence of Incomplete Information." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-227633.
Full textAbstract:
Ontology-based data access (OBDA) augments classical query answering in databases by including domain knowledge provided by an ontology. An ontology captures the terminology of an application domain and describes domain knowledge in a machine-processable way. Formal ontology languages additionally provide semantics to these specifications. Systems for OBDA thus may apply logical reasoning to answer queries; they use the ontological knowledge to infer new information, which is only implicitly given in the data. Moreover, they usually employ the open-world assumption, which means that knowledge not stated explicitly in the data or inferred is neither assumed to be true nor false. Classical OBDA regards the knowledge however only w.r.t. a single moment, which means that information about time is not used for reasoning and hence lost; in particular, the queries generally cannot express temporal aspects.
We investigate temporal query languages that allow to access temporal data through classical ontologies. In particular, we study the computational complexity of temporal query answering regarding ontologies written in lightweight description logics, which are known to allow for efficient reasoning in the atemporal setting and are successfully applied in practice. Furthermore, we present a so-called rewritability result for ontology-based temporal query answering, which suggests ways for implementation. Our results may thus guide the choice of a query language for temporal OBDA in data-intensive applications that require fast processing, such as context recognition.
30
Nogueira, Vitor Beires. "Temporal reasoning in a logic programming language with modularity." Doctoral thesis, Universidade de Évora, 2008. http://hdl.handle.net/10174/11138.
Full textAbstract:
Actualmente os Sistemas de Informação Organizacionais (SIO) lidam cada vez mais com informação que tem dependências temporais. Neste trabalho concebemos um ambiente de trabalho para construir e manter SIO Temporais. Este ambiente assenta sobre um linguagem lógica denominada Temporal Contextua) Logic Programming que integra modularidade com raciocínio temporal fazendo com que a utilização de um módulo dependa do tempo do contexto. Esta linguagem é a evolução de uma outra, também introduzida nesta tese, que combina Contextua) Logic Programming com Temporal Annotated Constraint Logic Programming, na qual a modularidade e o tempo são características ortogonais. Ambas as linguagens são formalmente discutidas e exemplificadas.
As principais contribuições do trabalho descrito nesta tese incluem:
• Optimização de Contextua) Logic Programming (CxLP) através de interpretação abstracta.
• Sintaxe e semântica operacional para uma linguagem que combina de um modo independente as linguagens Temporal Annotated Constraint Logic Programming (TACLP) e CxLP. É apresentado um compilador para esta linguagem.
• Linguagem (sintaxe e semântica) que integra de um modo inovador modularidade (CxLP) com raciocínio temporal (TACLP). Nesta linguagem a utilização de um dado módulo está dependente do tempo do contexto. É descrito um interpretador e um compilador para esta linguagem.
• Ambiente de trabalho para construir e fazer a manutenção de SIO Temporais. Assenta sobre uma especificação revista da linguagem ISCO, adicionando classes e manipulação de dados temporais. É fornecido um compilador em que a linguagem resultante é a descrita no item anterior. ABSTRACT- Current Organisational Information Systems (OIS) deal with more and more Infor-mation that, is time dependent. In this work we provide a framework to construct and maintain Temporal OIS. This framework builds upon a logical language called Temporal Contextual. Logic Programming that deeply integrates modularity with tem-poral reasoning making the usage of a module time dependent. This language is an evolution of another one, also introduced in this thesis, that combines Contextual Logic Programming with Temporal Annotated Constraint Logic Programming where modularity and time are orthogonal features. Both languages are formally discussed and illustrated.
The main contributions of the work described in this thesis include:
• Optimisation of Contextual Logic Programming (CxLP) through abstract interpretation.
• Syntax and operational semantics for an independent combination of the temporal framework Temporal Annotated Constraint Logic Programming (TACLP) and CxLP. A compiler for this language is also provided.
• Language (syntax and semantics) that integrates in a innovative way modularity
(CxLP) with temporal reasoning (TACLP). In this language the usage of a given
module depends of the time of the context. An interpreter and a compiler for
this language are described.
• Framework to construct and maintain Temporal Organisational Information Systems. It builds upon a revised specification of the language ISCO, adding temporal classes and temporal data manipulation. A compiler targeting the language presented in the previous item is also given.
31
Magnusson, Martin. "Deductive Planning and Composite Actions in Temporal Action Logic." Licentiate thesis, Linköping : Department of Computer and Information Science, Linköpings universitet, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-9726.
Full text
32
Sheridan, Daniel. "Temporal logic encodings for SAT-based bounded model checking." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/1467.
Full textAbstract:
Since its introduction in 1999, bounded model checking (BMC) has quickly become a serious and indispensable tool for the formal verification of hardware designs and, more recently, software. By leveraging propositional satisfiability (SAT) solvers, BMC overcomes some of the shortcomings of more conventional model checking methods. In model checking we automatically verify whether a state transition system (STS) describing a design has some property, commonly expressed in linear temporal logic (LTL). BMC is the restriction to only checking the looping and non-looping runs of the system that have bounded descriptions. The conventional BMC approach is to translate the STS runs and LTL formulae into propositional logic and then conjunctive normal form (CNF). This CNF expression is then checked by a SAT solver. In this thesis we study the effect on the performance of BMC of changing the translation to propositional logic. One novelty is to use a normal form for LTL which originates in resolution theorem provers. We introduce the normal form conversion early on in the encoding process and examine the simplifications that it brings to the generation of propositional logic. We further enhance the encoding by specialising the normal form to take advantage of the types of runs peculiar to BMC. We also improve the conversion from propositional logic to CNF. We investigate the behaviour of the new encodings by a series of detailed experimental comparisons using both hand-crafted and industrial benchmarks from a variety of sources. These reveal that the new normal form based encodings can reduce the solving time by a half in most cases, and up to an order of magnitude in some cases, the size of the improvement corresponding to the complexity of the LTL expression. We also compare our method to the popular automata-based methods for model checking and BMC.
33
Taboada, Sophie. "Multi-Agent Motion Planning with Signal Temporal Logic Constraints." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-292870.
Full textAbstract:
Motion planning algorithms allow us to define a sequence of configurations to guide robots from a starting point to an ending goal while considering the environment’s and the robot’s constraints. As all robots and circumstances are different, motion planning can be adapted to fit into the system’s specifications and the user’s preferences. Temporal Logic (TL) has been used to enable the implementation of more complex missions. In this work, we are interested in using TL to establish the affiliation between robots in a multi-robot system, as well as their affiliation with features in the workspace. More specifically, Signal Temporal Logic (STL) is used to guide motion planning into respecting certain preferences linked to the robot’s motion behavior. In fact, user’s preferences are translated into STL formulas, that need to be respected by the motion planning. To achieve this, RRT* sampling-based algorithm is used to study the free space and to identify the best trajectory with the help of a cost analysis of all possible trajectories found. Here, RRT* is adapted to fit into multi-robot systems and to allow the simultaneous planning of trajectories for multiple robots. The robustness metric of STL quantifies the respect trajectories have for STL formulas and influences the cost function of the RRT*. The impact the robustness has on the cost function is responsible for the selection of trajectories with more respect for the STL formulas. The proposed multi-agent motion planning is tested in simulations with environments containing multiple obstacles and robots. To demonstrate the impact STL has on motion planning, a comparison is made between the trajectories extracted with and without the use of STL. These simulations include specific scenarios and different numbers of robots to test the developed algorithm. They deliver asymptotically optimal solutions. Finally, we conduct some hardware experiments up until four robots to present how the developed motion planning can be implemented in real life.Rörelseplaneringsalgoritmer låter oss definiera en sekvens av konfigurationer för att guida robotar från en startposition till en slutposition medan vi tar hänsyn till robotens och miljöns begränsningar. Eftersom alla robotar och omständigheter är olika kan rörelseplanering anpassas för att passa systemets specifikationer och användarens preferenser. Temporal Logik (TL) har använts för att möjliggöra implementationer av mer komplexa uppdrag. I detta arbete är vi intresserade av att använda TL för att fastställa anslutningen mellan robotar i ett multirobotsystem, samt mellan dessa robotar och egenskaper i deras arbetsmiljö. Mer specifikt används signaltemporär logik (eng: Signal Temporal Logic) (STL) för att anpassa rörelseplanering till att respektera vissa preferenser länkade till robotens rörelsebeteende. Faktum är att användarpreferenser översätts till STL-formler som behöver respekteras av rörelseplaneringen. För att uppnå detta används den samplingsbaserade algoritmen RRT* för att studera den fria ytan och för att identifiera den bästa rörelsebanan med hjälp av en kostanalys av alla funna möjliga rörelsebanor. Här anpassas RRT* för multirobotsystem och för att tillåta planering av rörelsebanor för flera robotar samtidigt. Robushetsmåttet för STL kvantifierar respekten som banorna har för STL-formler och påverkar RRT*: s kostnadsfunktion. Påverkan som robustheten har på kostfunktionen är ansvarig för valet av rörelsebanor som till högre grad respekterar STL-formlerna. Den föreslagna röresleplaneringen för flera agenter (eng: multi-agent) testas i simuleringar av miljöer med flera hinder och robotar. För att demonstrera vilken inverkan STL har på rörelseplanering görs en jämförelse mellan rörelsebanor som ges med och utan användning av STL. Dessa simuleringar inkluderar specifika scenarion och olika antal robotar för att testa den utvecklade algoritmen. De levererar asymptotiskt optimala lösningar. Slutligen genomför vi hårdvaruexperiment upp till och med fyra robotar för att presentera hur den framtagna rörelseplaneringsalgoritmen kan implementeras i verkligheten.
34
Banks, Christopher Jon. "Spatio-temporal logic for the analysis of biochemical models." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/10512.
Full textAbstract:
Process algebra, formal specification, and model checking are all well studied techniques in the analysis of concurrent computer systems. More recently these techniques have been applied to the analysis of biochemical systems which, at an abstract level, have similar patterns of behaviour to concurrent processes. Process algebraic models and temporal logic specifications, along with their associated model-checking techniques, have been used to analyse biochemical systems. In this thesis we develop a spatio-temporal logic, the Logic of Behaviour in Context (LBC), for the analysis of biochemical models. That is, we define and study the application of a formal specification language which not only expresses temporal properties of biochemical models, but expresses spatial or contextual properties as well. The logic can be used to express, or specify, the behaviour of a model when it is placed into the context of another model. We also explore the types of properties which can be expressed in LBC, various algorithms for model checking LBC - each an improvement on the last, the implementation of the computational tools to support model checking LBC, and a case study on the analysis of models of post-translational biochemical oscillators using LBC. We show that a number of interesting and useful properties can be expressed in LBC and that it is possible to express highly useful properties of real models in the biochemistry domain, with practical application. Statements in LBC can be thought of as expressing computational experiments which can be performed automatically by means of the model checker. Indeed, many of these computational experiments can be higher-order meaning that one succinct and precise specification in LBC can represent a number of experiments which can be automatically executed by the model checker.
35
Evans, David Hugh. "An investigation of persistence in temporal reasoning." Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.267814.
Full text
36
Baysal, Onur Alizde Rarail. "Lower-top and upper-bottom points for any formula in temporal logic/." [s.l.]: [s.n.], 2006. http://library.iyte.edu.tr/tezler/master/matematik/T000549.pdf.
Full text
37
Tsiknis, George. "Specification-verification of protocols : the significant event temporal logic technique." Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/25047.
Full textAbstract:
This thesis addresses the problem of protocol verification. We first present a brief review of the existing specification methods for communication protocols, with emphasis on the hybrid techniques. The alternating bit protocol is specified in ISO/FDT, BBN/FST and UNISPEX to provide a comparison between three interesting hybrid models of protocol specification. A method for applying the unbounded state Temporal Logic to verify a protocol specified in a hybrid technique (in particular FDT) is outlined. Finally, a new specification and verification method called SETL is proposed, which is based on event sequences and temporal logic. To illustrate the method two data transfer protocols namely, the stop-wait and alternating bit protocols are specified in SETL and verified. We demonstrate that SETL is a generalization of the hybrid techniques, it is sound and that it can be semi-automated.Science, Faculty of
Computer Science, Department of
Graduate
38
Montana, Felipe. "Sampling-based algorithms for motion planning with temporal logic specifications." Thesis, University of Sheffield, 2019. http://etheses.whiterose.ac.uk/22637/.
Full text
39
Cizelj, Igor. "Vehicle control from temporal logic specifications with probabilistic satisfaction guarantees." Thesis, Boston University, 2014. https://hdl.handle.net/2144/10967.
Full textAbstract:
Thesis (Ph.D.)--Boston UniversityTemporal logics, such as Linear Temporal Logic (LTL) and Computation Tree Logic (CTL), have become increasingly popular for specifying complex mission specifications in motion planning and control synthesis problems. This dissertation proposes and evaluates methods and algorithms for synthesizing control strategies for different vehicle models from temporal logic specifications. Complex vehicle models that involve systems of differential equations evolving over continuous domains are considered. The goal is to synthesize control strategies that maximize the probability that the behavior of the system, in the presence of sensing and actuation noise, satisfies a given temporal logic specification. The first part of this dissertation proposes an approach for designing a vehicle control strategy that maximizes the probability of accomplishing a motion specification given as a Probabilistic CTL (PCTL) formula. Two scenarios are examined. First, a threat-rich environment is considered when the motion of a vehicle in the environment is given as a finite transition system. Second, a noisy Dubins vehicle is considered. For both scenarios, the motion of the vehicle in the environment is modeled as a Markov Decision Process (MDP) and an approach for generating an optimal MDP control policy that maximizes the probability of satisfying the PCTL formula is introduced. The second part of this dissertation introduces a human-supervised control synthesis method for a noisy Dubins vehicle such that the expected time to satisfy a PCTL formula is minimized, while maintaining the satisfaction probability above a given probability threshold. A method for abstracting the motion of the vehicle in the environment in the form of an MDP is presented. An algorithm for synthesizing an optimal MDP control policy is proposed. If the probability threshold cannot be satisfied with the initial specification, the presented framework revises the specifica- tion until the supervisor is satisfied with the revised specification and the satisfaction probability is above the threshold. The third part of this dissertation focuses on the problem of stochastic control of a noisy differential drive mobile robot such that the probability of satisfying a time constrained specification, given as a Bounded LTL (BLTL) formula, is maximized. A method for mapping noisy sensor measurements to an MDP is introduced. Due to the size of the MDP, finding the exact solution is computationally too expensive. Correctness is traded for scalability, and an MDP control synthesis method based on Statistical Model Checking is introduced.
40
Chatzis, Ioannis. "Motion Planning of Multi-Agent Systems under Temporal Logic Specifications." Thesis, KTH, Reglerteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177640.
Full textAbstract:
In this thesis, a top-down hierarchical framework is proposed to deal with multiagentsymbolic motion planning and control. Agents are assigned a distributable globalmission, and are partitioned into leaders and followers. The global mission is distributedamong the followers and each one synthesizes a discrete motion plan. By exploitingthe concept of network controllability, an open-loop optimal control law is synthesizedcentrally and executed in a distributed manner. This control law guarantees the concurrentexecution and fulfillment of the followers’ discrete motion plans. Simulations areperformed to verify the proposed control law both for single- and multi-leader, leaderfollowernetworks.
41
Drollinger, Nadine. "Developing a System for Robust Planning using Linear Temporal Logic." Thesis, KTH, Reglerteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231846.
Full textAbstract:
Human robot-collaborative search missions have gotten more and more attention in recent years.Especially in scenarios where the robot first scouts the scene before sending in human agents. Thissaves time and avoids unnecessary risks for the human agents. One possible configuration of such arescue team is, a human operator instructing a unmanned aerial vehicle (UAV) via speech-commandshow to traverse through an environment to investigate areas of interest. A first step to address thisproblem is presented in this master thesis by developing a framework for mapping temporal logicinstructions to physical motion of a UAV.The fact that natural language has a strong resemblance to the logic formalism of Linear-TemporalLogic (LTL) is exploited. Constraints expressed as an LTL-formula are imposed on a provided labeledmap of the environment. An LTL-to-cost-map converter including a standard input-skeleton is developed.Respective cost maps are obtained and a satisfaction-measure of fulfilling these constraints ispresented. The input-skeleton and the map-converter are then combined with a cost-map-based pathplanning algorithm in order to obtain solution sets. A clarification request is created such that theoperator can choose which solution set should be executed. The proposed framework is successivelyvalidated, first by MATLAB-experiments to ensure the validity of the cost-map-creation followed bysimulation experiments in ROS incorporating the entire framework. Finally, a real-world experimentis performed at the SML to validate the proposed framework.Human-robot-collaborative search missions har f°att ¨okad uppm¨arksamhet de senaste°aren. Framf¨orallt i scenarion d¨ar roboten f¨orst utforskar milj¨on innan m¨anskliga agenter intr¨ader, vilket spararb°ade tid och undviker on¨odiga risker f¨or de m¨anskliga agenterna. En m¨ojlig konfiguration f¨or ettr¨addningsteam ¨ar d°a en m¨ansklig operator instruerar en UAV via tal-teknologi hur den ska navigeragenom en milj¨o f¨or att unders¨oka omr°aden av intresse. Den h¨ar uppsatsen ¨amnar att unders¨okadetta problem genom att utveckla ett ramverk f¨or kopplingen mellan temporal-logiska instruktionentill fysiska r¨orelsem¨onster f¨or en UAV. Faktumet att naturligt spr°ak har en stark samh¨orighetmellan logisk formalist av Linj¨ar Temporal Logik (LTL) ¨ar exploaterat. Constraints uttryckta somen LTL-formula tillf¨ors p°a en tillhandah°allen klassificerad karta av omgivningen. I denna rapportpresenteras en LTL-cost-to-map-¨overs¨attning som inkluderar ett standardiserat input-skelett. Vidarepresenteras kostnadskartor med tillfredst¨allelse-m°att som uppfyller dessa krav. Input-skelettet ochmap-konverteraren kombineras sedan med en cost-map-baserad path planning algoritm f¨or att erh°allal¨osningsset. En klarifikationsf¨orfr°agan ¨ar skapad s°a att operatorn kan v¨alja vilket l¨osningsset som skaexekveras. Det f¨oreslagna ramverket ¨ar successivt validerat, inledningsvis med MATLAB-experimentf¨or valideringen av cost-map-kreationen f¨oljt av simuleringsexperiment i ROS som inkorporerar helaramverket. Slutligen utf¨ors ett real-time experiment vid SML f¨or att validera det f¨oreslagna ramverket.
42
Hussain, Faraz. "Enhancing a behavioral interface specification language with temporal logic features." [Ames, Iowa : Iowa State University], 2009.
Find full text
43
Andersson, Sofie. "Automatic Control Design Synthesis under Metric Interval Temporal Logic Specifications." Thesis, KTH, Skolan för elektro- och systemteknik (EES), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-187716.
Full textAbstract:
The problem of synthesizing controllers for motion planning of multi-agent systems under Linear Temporal Logic (LTL) high-level specifications has been of great interest and has been widely studied over the last years. However, LTL cannot handle time constraints as specifications. The time aspect would allow more complicated and specific tasks and it is therefore desirable to incorporate. This work aims to determine how control synthesis for a continuous linear system can be performed based on Metric Interval Temporal Logic (MITL), which is able to handle desired time constraints to high-level specifications. Firstly, a control design synthesis method for a single-agent, based on previous work within both the field of LTL and MITL is presented. Secondly, a control design synthesis method for multi-agent systems considering both local an global MITL specifications is presented. Extended simulations has been performed in MATLAB environment demonstrating the two proposed methodologies. The result shows that the methods guarantee that the MITL specifications are satisfied, for all cases for which a solution is found.Problemet gällande regulator syntetisering for rörelse planering av fler-agents system under Line-ar Temporal Logic (Linjär Temporal Logik=LTL) hög-nivå specifikationer har varit av stort intresse och har studerats brett under de senaste åren. LTL kan emellertid inte hantera tidsbegränsningar som specifikationer. Tidsaspekten skulle tillåta mer komplicerade och specifika uppgifter. Det är därför önskvärt att inkorporera. Målet med det här arbetet är att fastställa hur regulator syntetisering för ett kontinuerligt, linjärt system kan utföras utgående från Metric Interval Temporal Logic (Metrisk Intervall Temporal Logic =MITL), en gren av Temporal Logik som kan hantera de önskvärda tidsbegränsningarna för högnivå specifikationer. Först presenteras en metod för att syntetisera regulatorer för en-agents system. Metoden är baserad på tidigare arbeten inom fälten LTL och MITL. Sedan presenteras en metod för att syntetisera regulatorer för fler-agents system som ¨önskas uppfylla såväl lokala som globala MITL specifikationer. Utbredda simulationer har genomförts i MATLAB miljö för att demonstrera de två˚ föreslagna metoderna. Resultatet visar att metoderna garanterar att MITL specifikationerna är uppfyllda för alla fall för vilka en lösning hittas.
44
Gario, Marco. "A Formal Foundation of FDI Design via Temporal Epistemic Logic." Doctoral thesis, Università degli studi di Trento, 2016. https://hdl.handle.net/11572/368759.
Full textAbstract:
Autonomous systems must be able to detect and promptly react to faults. Fault Detection and Identification components (FDI) are in charge of detecting the occurrence of faults.
The FDI depends on the concrete design of the system, needs to take into account how faults might interact, and can only have a partial view of the run-time state through sensors. For these reasons, the development of the FDI and certification of its correctness and quality are difficult tasks. This difficulty is compounded by the fact that current approaches for verification of the FDI rely on manual inspection and testing. Motivated by industrial case-studies from the European Space Agency, this thesis proposes a formal foundation for FDI design that covers specification, validation, verification, and synthesis.
The Alarm Specification Language (ASLk) is introduced in order to formally capture a set of interesting and desirable properties of the FDI components. ASLk is equipped with a semantics based on Temporal Epistemic Logic, thus enabling reasoning about partially observable systems. Automated reasoning techniques can then be applied to perform validation, verification, and synthesis of the FDI. This formal process guarantees that the generated FDI satisfies the designer expectations. The problems deriving from this process were out of reach for existing model-checking techniques. Therefore, we develop novel and efficient techniques for model-checking temporal epistemic logic over infinite state systems.
45
Gario, Marco. "A Formal Foundation of FDI Design via Temporal Epistemic Logic." Doctoral thesis, University of Trento, 2016. http://eprints-phd.biblio.unitn.it/1676/1/gario_phd.pdf.
Full textAbstract:
Autonomous systems must be able to detect and promptly react to faults. Fault Detection and Identification components (FDI) are in charge of detecting the occurrence of faults.
The FDI depends on the concrete design of the system, needs to take into account how faults might interact, and can only have a partial view of the run-time state through sensors. For these reasons, the development of the FDI and certification of its correctness and quality are difficult tasks. This difficulty is compounded by the fact that current approaches for verification of the FDI rely on manual inspection and testing. Motivated by industrial case-studies from the European Space Agency, this thesis proposes a formal foundation for FDI design that covers specification, validation, verification, and synthesis.
The Alarm Specification Language (ASLk) is introduced in order to formally capture a set of interesting and desirable properties of the FDI components. ASLk is equipped with a semantics based on Temporal Epistemic Logic, thus enabling reasoning about partially observable systems. Automated reasoning techniques can then be applied to perform validation, verification, and synthesis of the FDI. This formal process guarantees that the generated FDI satisfies the designer expectations. The problems deriving from this process were out of reach for existing model-checking techniques. Therefore, we develop novel and efficient techniques for model-checking temporal epistemic logic over infinite state systems.
46
Martiny, Karsten [Verfasser]. "PDT logic : a probabilistic doxastic temporal logic for reasoning about beliefs in multi-agent systems / Karsten Martiny." Lübeck : Zentrale Hochschulbibliothek Lübeck, 2018. http://d-nb.info/1152030132/34.
Full text
47
湯志輝 and Chi-fai Tong. "On checking the temporal consistency of data." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1993. http://hub.hku.hk/bib/B31211914.
Full text
48
Tong, Chi-fai. "On checking the temporal consistency of data /." [Hong Kong : University of Hong Kong], 1993. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13570353.
Full text
49
Kellett, Adam. "Implementing and extending Concurrent METATEM." Thesis, University of East London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.327709.
Full text
50
Dimitriov, Jordan. "Developing semantics of Verilog HDL in formal compositional design of mixed hardware/software systems." Thesis, De Montfort University, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250766.
Full text