Event Structures With Higher Order Dynamics

DOWNLOAD

Download Event Structures With Higher Order Dynamics PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Event Structures With Higher Order Dynamics book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page

Event Structures With Higher Order Dynamics

DOWNLOAD
Author : Karcher, David S.
language : en
Publisher: Universitätsverlag der TU Berlin
Release Date : 2019-03-11

Event Structures With Higher Order Dynamics written by Karcher, David S. and has been published by Universitätsverlag der TU Berlin this book supported file pdf, txt, epub, kindle and other format this book has been release on 2019-03-11 with Computers categories.

Event Structure were introduced in 1979 [18] as a formal model to connect the theory of Petri nets and domain theory. Originally they consisted of atomic non-repeatable events, a binary causal dependency relation, and a binary conflict relation between those events. For a long time various extensions of the original formalism were used to define semantics for other structures such as classes of Petri nets and process calculi.In this thesis the Event Structures (ESs) are considered solely as a declarative modelling tool than as a formalism to define semantics for other structures. In order to model highly dynamic real-world processes (i.e. processes in which occurrences of events may change the dependencies of other events) with a concise model the dynamics must be an inherent part of the modelling formalism. Therefore, the Higher-Order Dynamic-Causality ESs (HDESs) were introduced. They consist of a finite set of atomic non-repeatable events, a causal dependency relation between these events, and a rule-based formalism for events to change the dependencies and the existing rules. This formalism is studied with the respect to its expressive power in comparison to transition systems, some subclasses of HDESs, and to Dynamic Condition Response Graphs (DCR-Graphs). A web tool was created in which HDESs can be defined and explored by executing events, creating the corresponding transition system, or even applying some predefined transformations.Ereignisstrukturen wurden 1979 als formales Modell eingeführt um die Theorie der Petri Netze mit der Theorie der Verbände zu verknüpfen. Ursprünglich bestanden sie aus atomaren nicht wiederholbaren Ereignissen, einer binären kausalen Abhängigkeitsrelation und einer binären Konfliktrelation auf den Ereignissen. Lange Zeit wurden verschiedene Erweiterungen des Ursprungsformalismus genutzt, um Semantiken für andere Strukturen zu definieren (z.B. Klassen von Petri Netzen und Prozesskalkülen). In dieser Arbeit werden Ereignisstrukturen (ESs) als deklarativer Modellierungsformalismus betrachtet und nicht, um Semantiken für andere Strukturen zu definieren. Um hochdynamische Prozesse (also Prozesse, in denen Ereignisse die Abhängigkeiten anderer Ereignisse verändern können) aus der realen Welt in einem präzisen, aber kleinen Modell abbilden zu können, muss die Dynamik inhärenter Bestandteil des Modellierungsformalismus sein. Um dieses leisten zu können, wurden die Higher-Order Dynamic-Causality ESs (HDESs) eingeführt. Sie bestehen aus einer endlichen Menge atomarer und nicht wiederholbarer Ereignisse, einer kausalen Abhängigkeitsrelation auf diesen Ereignissen und einem regelbasierten Formalismus, mit dem Ereignisse die Abhängigkeiten anderer Ereignisse (und auch eben diese Regeln) verändern können. Der Formalismus wird bezüglich seiner Ausdrucksstärke im Vergleich zu Transitionssystemen, zu einigen Unterklassen von HDESs und zu Dynamic Condition Response Graphs (DCR-Graphs) betrachtet. Des Weiteren wird ein Web-Tool vorgestellt, das es ermöglicht, HDESs zu definieren und zu erforschen, indem man Ereignisse ausführt, das zugehörige Transitionssystem erzeugt oder vordefinierte Transformationen anwendet.

Theoretical Aspects Of Computing Ictac 2015

DOWNLOAD
Author : Martin Leucker
language : en
Publisher: Springer
Release Date : 2015-10-08

Theoretical Aspects Of Computing Ictac 2015 written by Martin Leucker and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2015-10-08 with Computers categories.

This book constitutes the refereed proceedings of the 12th International Colloquium on Theoretical Aspects of Computing, ICTAC 2015, held in Cali, Colombia, in October 2015. The 25 revised full papers presented together with 7 invited talks, 3 tool papers, and 2 short papers were carefully reviewed and selected from 93 submissions. The papers cover various topics such as algebra and category theory; automata and formal languages; concurrency; constraints, logic and semantic; software architecture and component-based design; and verification.

Elements Of Dynamic And 2 Sat Programming Paths Trees And Cuts

DOWNLOAD
Author : Bentert, Matthias
language : en
Publisher: Universitätsverlag der TU Berlin
Release Date : 2021-11-18

Elements Of Dynamic And 2 Sat Programming Paths Trees And Cuts written by Bentert, Matthias and has been published by Universitätsverlag der TU Berlin this book supported file pdf, txt, epub, kindle and other format this book has been release on 2021-11-18 with Computers categories.

In dieser Arbeit entwickeln wir schnellere exakte Algorithmen (schneller bezüglich der Worst-Case-Laufzeit) für Spezialfälle von Graphproblemen. Diese Algorithmen beruhen größtenteils auf dynamischem Programmieren und auf 2-SAT-Programmierung. Dynamisches Programmieren beschreibt den Vorgang, ein Problem rekursiv in Unterprobleme zu zerteilen, sodass diese Unterprobleme gemeinsame Unterunterprobleme haben. Wenn diese Unterprobleme optimal gelöst wurden, dann kombiniert das dynamische Programm diese Lösungen zu einer optimalen Lösung des Ursprungsproblems. 2-SAT-Programmierung bezeichnet den Prozess, ein Problem durch eine Menge von 2-SAT-Formeln (aussagenlogische Formeln in konjunktiver Normalform, wobei jede Klausel aus maximal zwei Literalen besteht) auszudrücken. Dabei müssen erfüllende Wahrheitswertbelegungen für eine Teilmenge der 2-SAT-Formeln zu einer Lösung des Ursprungsproblems korrespondieren. Wenn eine 2-SAT-Formel erfüllbar ist, dann kann eine erfüllende Wahrheitswertbelegung in Linearzeit in der Länge der Formel berechnet werden. Wenn entsprechende 2-SAT-Formeln also in polynomieller Zeit in der Eingabegröße des Ursprungsproblems erstellt werden können, dann kann das Ursprungsproblem in polynomieller Zeit gelöst werden. Im folgenden beschreiben wir die Hauptresultate der Arbeit. Bei dem Diameter-Problem wird die größte Distanz zwischen zwei beliebigen Knoten in einem gegebenen ungerichteten Graphen gesucht. Das Ergebnis (der Durchmesser des Eingabegraphen) gehört zu den wichtigsten Parametern der Graphanalyse. In dieser Arbeit erzielen wir sowohl positive als auch negative Ergebnisse für Diameter. Wir konzentrieren uns dabei auf parametrisierte Algorithmen für Parameterkombinationen, die in vielen praktischen Anwendungen klein sind, und auf Parameter, die eine Distanz zur Trivialität messen. Bei dem Problem Length-Bounded Cut geht es darum, ob es eine Kantenmenge begrenzter Größe in einem Eingabegraphen gibt, sodass das Entfernen dieser Kanten die Distanz zwischen zwei gegebenen Knoten auf ein gegebenes Minimum erhöht. Wir bestätigen in dieser Arbeit eine Vermutung aus der wissenschaftlichen Literatur, dass Length-Bounded Cut in polynomieller Zeit in der Eingabegröße auf Einheitsintervallgraphen (Intervallgraphen, in denen jedes Intervall die gleiche Länge hat) gelöst werden kann. Der Algorithmus basiert auf dynamischem Programmieren. k-Disjoint Shortest Paths beschreibt das Problem, knotendisjunkte Pfade zwischen k gegebenen Knotenpaaren zu suchen, sodass jeder der k Pfade ein kürzester Pfad zwischen den jeweiligen Endknoten ist. Wir beschreiben ein dynamisches Programm mit einer Laufzeit n^O((k+1)!) für dieses Problem, wobei n die Anzahl der Knoten im Eingabegraphen ist. Dies zeigt, dass k-Disjoint Shortest Paths in polynomieller Zeit für jedes konstante k gelöst werden kann, was für über 20 Jahre ein ungelöstes Problem der algorithmischen Graphentheorie war. Das Problem Tree Containment fragt, ob ein gegebener phylogenetischer Baum T in einem gegebenen phylogenetischen Netzwerk N enthalten ist. Ein phylogenetisches Netzwerk (bzw. ein phylogenetischer Baum) ist ein gerichteter azyklischer Graph (bzw. ein gerichteter Baum) mit genau einer Quelle, in dem jeder Knoten höchstens eine ausgehende oder höchstens eine eingehende Kante hat und jedes Blatt eine Beschriftung trägt. Das Problem stammt aus der Bioinformatik aus dem Bereich der Suche nach dem Baums des Lebens (der Geschichte der Artenbildung). Wir führen eine neue Variante des Problems ein, die wir Soft Tree Containment nennen und die bestimmte Unsicherheitsfaktoren berücksichtigt. Wir zeigen mit Hilfe von 2-SAT-Programmierung, dass Soft Tree Containment in polynomieller Zeit gelöst werden kann, wenn N ein phylogenetischer Baum ist, in dem jeweils maximal zwei Blätter die gleiche Beschriftung tragen. Wir ergänzen dieses Ergebnis mit dem Beweis, dass Soft Tree Containment NP-schwer ist, selbst wenn N auf phylogenetische Bäume beschränkt ist, in denen jeweils maximal drei Blätter die gleiche Beschriftung tragen. Abschließend betrachten wir das Problem Reachable Object. Hierbei wird nach einer Sequenz von rationalen Tauschoperationen zwischen Agentinnen gesucht, sodass eine bestimmte Agentin ein bestimmtes Objekt erhält. Eine Tauschoperation ist rational, wenn beide an dem Tausch beteiligten Agentinnen ihr neues Objekt gegenüber dem jeweiligen alten Objekt bevorzugen. Reachable Object ist eine Verallgemeinerung des bekannten und viel untersuchten Problems Housing Market. Hierbei sind die Agentinnen in einem Graphen angeordnet und nur benachbarte Agentinnen können Objekte miteinander tauschen. Wir zeigen, dass Reachable Object NP-schwer ist, selbst wenn jede Agentin maximal drei Objekte gegenüber ihrem Startobjekt bevorzugt und dass Reachable Object polynomzeitlösbar ist, wenn jede Agentin maximal zwei Objekte gegenüber ihrem Startobjekt bevorzugt. Wir geben außerdem einen Polynomzeitalgorithmus für den Spezialfall an, in dem der Graph der Agentinnen ein Kreis ist. Dieser Polynomzeitalgorithmus basiert auf 2-SAT-Programmierung. This thesis presents faster (in terms of worst-case running times) exact algorithms for special cases of graph problems through dynamic programming and 2-SAT programming. Dynamic programming describes the procedure of breaking down a problem recursively into overlapping subproblems, that is, subproblems with common subsubproblems. Given optimal solutions to these subproblems, the dynamic program then combines them into an optimal solution for the original problem. 2-SAT programming refers to the procedure of reducing a problem to a set of 2-SAT formulas, that is, boolean formulas in conjunctive normal form in which each clause contains at most two literals. Computing whether such a formula is satisfiable (and computing a satisfying truth assignment, if one exists) takes linear time in the formula length. Hence, when satisfying truth assignments to some 2-SAT formulas correspond to a solution of the original problem and all formulas can be computed efficiently, that is, in polynomial time in the input size of the original problem, then the original problem can be solved in polynomial time. We next describe our main results. Diameter asks for the maximal distance between any two vertices in a given undirected graph. It is arguably among the most fundamental graph parameters. We provide both positive and negative parameterized results for distance-from-triviality-type parameters and parameter combinations that were observed to be small in real-world applications. In Length-Bounded Cut, we search for a bounded-size set of edges that intersects all paths between two given vertices of at most some given length. We confirm a conjecture from the literature by providing a polynomial-time algorithm for proper interval graphs which is based on dynamic programming. k-Disjoint Shortest Paths is the problem of finding (vertex-)disjoint paths between given vertex terminals such that each of these paths is a shortest path between the respective terminals. Its complexity for constant k > 2 has been an open problem for over 20 years. Using dynamic programming, we show that k-Disjoint Shortest Paths can be solved in polynomial time for each constant k. The problem Tree Containment asks whether a phylogenetic tree T is contained in a phylogenetic network N. A phylogenetic network (or tree) is a leaf-labeled single-source directed acyclic graph (or tree) in which each vertex has in-degree at most one or out-degree at most one. The problem stems from computational biology in the context of the tree of life (the history of speciation). We introduce a particular variant that resembles certain types of uncertainty in the input. We show that if each leaf label occurs at most twice in a phylogenetic tree N, then the problem can be solved in polynomial time and if labels can occur up to three times, then the problem becomes NP-hard. Lastly, Reachable Object is the problem of deciding whether there is a sequence of rational trades of objects among agents such that a given agent can obtain a certain object. A rational trade is a swap of objects between two agents where both agents profit from the swap, that is, they receive objects they prefer over the objects they trade away. This problem can be seen as a natural generalization of the well-known and well-studied Housing Market problem where the agents are arranged in a graph and only neighboring agents can trade objects. We prove a dichotomy result that states that the problem is polynomial-time solvable if each agent prefers at most two objects over its initially held object and it is NP-hard if each agent prefers at most three objects over its initially held object. We also provide a polynomial-time 2-SAT program for the case where the graph of agents is a cycle.

Coordination Models And Languages

DOWNLOAD
Author : Hanne Riis Nielson
language : en
Publisher: Springer
Release Date : 2019-06-04

Coordination Models And Languages written by Hanne Riis Nielson and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2019-06-04 with Computers categories.

This book constitutes the proceedings of the 21th International Conference on Coordination Models and Languages, COORDINATION 2019, held in Kongens Lyngby, Denmark, in June 2019, as part of the 14th International Federated Conference on Distributed Computing Techniques, DisCoTec 2019. The 15 full papers included in this volume were carefully reviewed and selected from 25 submissions. The papers are organized in topical sections named: computational models; tools; exploring new frontiers; and coordination patterns.

Formal Techniques For Distributed Objects Components And Systems

DOWNLOAD
Author : Susanne Graf
language : en
Publisher: Springer
Release Date : 2015-05-05

Formal Techniques For Distributed Objects Components And Systems written by Susanne Graf and has been published by Springer this book supported file pdf, txt, epub, kindle and other format this book has been release on 2015-05-05 with Computers categories.

This book constitutes the proceedings of the 35th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components and Systems, FORTE 2015, held in Grenoble, France, in June 2015, as part of the 10th International Federated Conference on Distributed Computing Techniques, DisCoTec 2015. The 15 revised full papers presented were carefully reviewed and selected from 53 submissions. The papers present a wide range of topics on distributed computing models and formal specification, testing, and verification methods.

Dynamic Modelling Of Information Systems

DOWNLOAD
Author : K.M. van Hee
language : en
Publisher: Elsevier
Release Date : 2014-06-28

Dynamic Modelling Of Information Systems written by K.M. van Hee and has been published by Elsevier this book supported file pdf, txt, epub, kindle and other format this book has been release on 2014-06-28 with Computers categories.

The use of dynamic models in the development of information systems is regarded by many researchers as a promising issue in design support. Modelling the dynamics of information systems is likely to improve the quality and the performance of the design products. Dynamic modelling as a new approach for dynamic analysis of problems within an existing situation, and design and evaluation of different solution strategies may overcome many difficulties in the design process.

Dualities In Graphs And Digraphs

DOWNLOAD
Author : Hatzel, Meike
language : en
Publisher: Universitätsverlag der TU Berlin
Release Date : 2023-05-23

Dualities In Graphs And Digraphs written by Hatzel, Meike and has been published by Universitätsverlag der TU Berlin this book supported file pdf, txt, epub, kindle and other format this book has been release on 2023-05-23 with Computers categories.

In this thesis we describe dualities in directed as well as undirected graphs based on tools such as width-parameters, obstructions and substructures. We mainly focus on directed graphs and their structure. In the context of a long open conjecture that bounds the monotonicity costs of a version of the directed cops and robber game, we introduce new width-measures based on directed separations that are closely related to DAG-width. We identify a tangle-like obstruction for which we prove a duality theorem. Johnson, Reed, Robertson, Seymour and Thomas introduced the width measure directed treewidth as a generalisation of treewidth for directed graphs. We introduce a new width measure, the cyclewidth, which is parametrically equivalent to directed treewidth. Making use of the connection between directed graphs and bipartite graphs with perfect matchings we characterise the digraphs of low cyclewidth. Generalising the seminal work by Robertson and Seymour resulting in a global structure theorem for undirected graphs, there is the goal of obtaining a structure theorem, based on directed treewidth, describing the structure of the directed graphs excluding a fixed butterfly minor. Working in this direction we present a new flat wall theorem for directed graphs which we believe to provide a better base for a directed structure theorem than the existing ones. On undirected graphs we present several results on induced subgraphs in the graphs themselves or the square graph of their linegraph. These results range from general statements about all graphs to the consideration of specific graph classes such as the one with exactly two moplexes. In der vorliegenden Arbeit beschreiben wir Dualitäten in gerichteten sowie in ungerichteten Graphen basierend auf Konzepten wie Weiteparametern, Obstruktionen und Substrukturen. Der Hauptfokus der Arbeit liegt bei gerichteten Graphen und ihrer Struktur. Im Kontext einer lange offenen Vermutung, dass die Monotoniekosten einer Variante des Räuber und Gendarm Spiels für gerichtete Graphen beschränkt sind, führen wir neue Weiteparameter ein, die auf gerichteten Separationen basieren und eng mit DAG-Weite verwandt sind. Wir identifizieren Tangle-artige Obstruktionen zu diesen Weiteparametern und beweisen die Dualität zwischen diesen beiden Konzepten. Johnson, Reed, Robertson, Seymour und Thomas haben die gerichtete Baumweite als gerichtete Verallgemeinerung der Baumweite auf ungerichteten Graphen eingeführt. Wir führen einen neuen Weiteparameter, die Cyclewidth, ein, der parametrisch equivalent zur gerichteten Baumweite ist. Unter Nutzung der Verwandtschaft von gerichteten Graphen und bipartiten Graphen mit perfekten Matchings charakterisieren wir die gerichteten Graphen mit kleiner Cyclewidth. Ein einschlagendes Ergebnis in der Graphenstrukturtheorie ist das Strukturtheorem von Robertson und Seymour. Basierend darauf gibt es Anstrengungen ein solches Strukturtheorem auch für gerichtete Graphen zu finden und dafür die gerichtete Baumweite als Grundlage zu nutzen. Dieses Theorem soll die Struktur aller gerichteten Graphen beschreiben, die einen festen gerichteten Graphen als Butterflyminoren ausschließen. In diesem Kontext beweisen wir ein neues Flat-wall-theorem für gerichtete Graphen, dass unserer Erwartung nach eine bessere Basis für ein gerichtetes Strukturtheorem bietet als die bisher betrachteten Alternativen. Auf ungerichteten Graphen präsentieren wir einige Ergebnisse bezüglich induzierten Subgraphen in gegebenen Graphen oder ihren Linegraphen. Diese Ergebnisse reichen von der Betrachtung spezifischer Graphklassen, wie den Graphen mit zwei Moplexen, bis zu Ergebnissen auf der allgemeinen Klasse aller Graphen.

The Oxford Handbook Of Event Structure

DOWNLOAD
Author : Robert Truswell
language : en
Publisher: Oxford University Press
Release Date : 2019-03-26

The Oxford Handbook Of Event Structure written by Robert Truswell and has been published by Oxford University Press this book supported file pdf, txt, epub, kindle and other format this book has been release on 2019-03-26 with Language Arts & Disciplines categories.

This handbook deals with research into the nature of events, and how we use language to describe events. The study of event structure over the past 60 years has been one of the most successful areas of lexical semantics, uniting insights from morphology and syntax, lexical and compositional semantics, cognitive science, and artificial intelligence to develop insightful theories of events and event descriptions. This volume provides accessible introductions to major topics and ongoing debates in event structure research, exploring what events are, how we perceive them, how we reason with them, and the role they play in the organization of grammar and discourse. The chapters are divided into four parts: the first covers metaphysical issues related to events; the second is concerned with the relationship between event structure and grammar; the third is a series of crosslinguistic case studies; and the fourth deals with links to cognitive science and artificial intelligence more broadly. The book is strongly interdisciplinary in nature, with insights from linguistics, philosophy, psychology, cognitive science, and computer science, and will appeal to a wide range of researchers and students from advanced undergraduate level upwards.

Language Cognition And Emotion In Keats S Poetry

DOWNLOAD
Author : Katrina Brannon
language : en
Publisher: Taylor & Francis
Release Date : 2022-10-31

Language Cognition And Emotion In Keats S Poetry written by Katrina Brannon and has been published by Taylor & Francis this book supported file pdf, txt, epub, kindle and other format this book has been release on 2022-10-31 with Language Arts & Disciplines categories.

Language, Cognition, and Emotion in Keats’s Poetry applies an innovative cognitive linguistic approach to the poetry of John Keats, the first of its kind to employ a cognitive-based framework to explore the expression and articulation of emotion in his work. Brannon adopts an embodied perspective to emotion, rooted in cognitive linguistics, cognitive grammar, and cognitive poetics but also works from figurative language and stylistics, in examining a selection of Keats’s poems. This approach allows for a close interrogation of the texts themselves but also the languages that compose them, comprising lexical and grammatical elements, which, when taken together, bring out the emotional saliency of Keatsian poetry. While revealing fresh insights into the work of John Keats, the book also sheds further light on the importance of cognitive approaches to poetic and grammatical analyses and how both language and the body can serve as forms of communication through which metaphors can be expressed and contextualized. This volume will appeal to students and scholars interested in cognitive linguistics, figurative language, emotion studies, cognitive science, and Anglophone poetry.

Structural Health Monitoring 2015

DOWNLOAD
Author : Fu-Kuo Chang
language : en
Publisher: DEStech Publications, Inc
Release Date : 2015-10-01

Structural Health Monitoring 2015 written by Fu-Kuo Chang and has been published by DEStech Publications, Inc this book supported file pdf, txt, epub, kindle and other format this book has been release on 2015-10-01 with Technology & Engineering categories.

Proceedings of the Tenth International Workshop on Structural Health Monitoring, September 1–3, 2015. Selected research on the entire spectrum of structural health techniques and areas of applicationAvailable in print, complete online text download or individual articles. Series book comprising two volumes provides selected international research on the entire spectrum of structural health monitoring techniques used to diagnose and safeguard aircraft, vehicles, buildings, civil infrastructure, ships and railroads, as well as their components such as joints, bondlines, coatings and more. Includes special sections on system design, signal processing, multifunctional materials, sensor distribution, embedded sensors for monitoring composites, reliability and applicability in extreme environments. The extensive contents can be viewed below.