다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

What is modal logic

ing WS1S Systems to Verify Parameterized Networks . . . . . . . . . . . . 188 Kai Baukus, Saddek Bensalem, Yassine Lakhnech and Karsten Stahl FMona: A Tool for Expressing Validation Techniques over Infinite State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204 J.-P. Bodeveix and M. Filali Transitive Closures of Regular Relations for Verifying Infinite-State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220 Bengt Jonsson and Marcus Nilsson Diagnostic and Test Generation Using Static Analysis to Improve Automatic Test Generation . . . . . . . . . . . . . 235 Marius Bozga, Jean-Claude Fernandez and Lucian Ghirvu Efficient Diagnostic Generation for Boolean Equation Systems . . . . . . . . . . . . 251 Radu Mateescu Efficient Model-Checking Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266 Jean-Pierre Krimm and Laurent Mounier Checking for CFFD-Preorder with Tester Processes . . . . . . . . . . . . . . . . . . . . . . . 283 Juhana Helovuo and Antti Valmari Fair Bisimulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 Thomas A. Henzinger and Sriram K. Rajamani Integrating Low Level Symmetries into Reachability Analysis . . . . . . . . . . . . . 315 Karsten Schmidt Model-Checking Tools Model Checking Support for the ASM High-Level Language . . . . . . . . . . . . . . 331 Giuseppe Del Castillo and Kirsten Winter Table of

Tools and Algorithms for the Construction and Analysis of Systems. Proc. TACAS 2009

Graph database models can be defined as those in which data structures for the schema and instances are modeled as graphs or generalizations of them, and data manipulation is expressed by graph-oriented operations and type constructors. These models took off in the eighties and early nineties alongside object-oriented models. Their influence gradually died out with the emergence of other database models, in particular geographical, spatial, semistructured, and XML. Recently, the need to manage information with graph-like nature has reestablished the relevance of this area. The main objective of this survey is to present the work that has been conducted in the area of graph database modeling, concentrating on data structures, query languages, and integrity constraints.

/pdf/survey-of-graph-database-models-2ssdmgcn9a.pdf

Survey of graph database models

Summary) The abstract should follow the structure of the article (relevance, degree of exploration of the problem, the goal, the main results, conclusion) and characterize the theoretical and practical significance of the study results. The abstract should not contain wording echoing the title, cumbersome grammatical structures and abbreviations. The text should be written in scientific style. The volume of abstracts (summaries) depends on the content of the article, but should not be less than 250 words. All abbreviations must be disclosed in the summary (in spite of the fact that they will be disclosed in the main text of the article), references to the numbers of publications from reference list should not be made. The sentences of the abstract should constitute an integral text, which can be made by use of the words “consequently”, “for example”, “as a result”. Avoid the use of unnecessary introductory phrases (eg, “the author of the article considers...”, “The article presents...” and so on.)

/pdf/ministry-of-education-and-science-of-the-russian-federation-7m2jn0xnm1.pdf

Ministry of Education and Science of the Russian Federation

The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, we combine the syntactic approach with modal logic, using transition systems to model reasoning. We use two syntactic epistemic modalities: ‘knowing at least’ a set of formulae and ‘knowing at most’ a set of formulae. We are particularly interested in models restricting the set of formulae known by an agent at a point in time to be finite. The resulting systems are investigated from the point of view of axiomatization and complexity. We show how these logics can be used to formalise non-omniscient agents who know some inference rules, and study their relationship to other systems of syntactic epistemic logics,

/pdf/the-dynamics-of-syntactic-knowledge-2fmka1rv0j.pdf

The Dynamics of Syntactic Knowledge

We define reachability logic (RL), a fragment of FO(TC) (with boolean variables) that admits efficient model checking – linear time with a small constant – as a function of the size of the structure being checked. RL is expressive enough so that modal logics PDL and CTL? can be linearly embedded in it. The model checking algorithm is also linear in the size of the formula, but exponential in the number of boolean variables occurring in it. In practice this number is very small. In particular, for CTL and PDL formulas the resulting model checking algorithm remains linear. For CTL? the complexity of model checking — which is PSPACE complete in the worst case — can be read from the face of the translated formula.

Reachability logic: an efficient fragment of transitive closure logic

This article describes results from a research project undertaken to explore the technical issues associated with integrating unstructured crowd sourced data with authoritative national mapping data. The ultimate objective is to develop methodologies to ensure the feature enrichment of authoritative data, using crowd sourced data. Users increasingly find that they wish to use data from both kinds of geographic data sources. Different techniques and methodologies can be developed to solve this problem. In our previous research, a position map matching algorithm was developed for integrating authoritative and crowd sourced road vector data, and showed promising results (Anand et al. 2010). However, especially when integrating different forms of data at the feature level, these techniques are often time consuming and are more computationally intensive than other techniques available. To tackle these problems, this project aims at developing a methodology for automated conflict

/pdf/geospatial-information-integration-for-authoritative-and-3y4yq6jwvr.pdf

Geospatial Information Integration for Authoritative and Crowd Sourced Road

In this paper, we consider the runtime monitoring of norms with imperfect monitors. A monitor is imperfect for a norm if it has insufficient observational capabilities to determine if a given execution trace of a multi-agent system complies with or violates the norm. One approach to the problem of imperfect monitors is to enhance the observational capabilities of the normative organisation. However this may be costly or in some cases impossible. Instead we show how to synthesise an approximation of an `ideal' norm that can be perfectly monitored given a monitor, and which is optimal in the sense that any other approximation would fail to detect at least as many violations of the ideal norm. We give a logical analysis of (im)perfect monitors. We state the computational complexity of the norm approximation problem, and give an optimal algorithm for generating optimal approximations of norms given a monitor.

/pdf/norm-approximation-for-imperfect-monitors-1bju2ymbzz.pdf

Norm approximation for imperfect monitors

Coalition logic is currently one of the most popular logics for multi-agent systems. While logics combining coalitional and epistemic operators have received considerable attention, completeness results for epistemic extensions of coalition logic have so far been missing. In this paper we provide several such results and proofs.We prove completeness for epistemic coalition logic with common knowledge, with distributed knowledge, and with both common and distributed knowledge, respectively. Furthermore, we completely characterise the complexity of the satisfiability problem for each of the three logics. We also study logics with interaction axioms connecting coalitional ability and knowledge.

/pdf/coalition-logic-with-individual-distributed-and-common-29z17ebpsi.pdf

Natasha Alechina

Papers

The Dynamics of Syntactic Knowledge

Reachability logic: an efficient fragment of transitive closure logic

Geospatial Information Integration for Authoritative and Crowd Sourced Road

Norm approximation for imperfect monitors

Coalition logic with individual, distributed and common knowledge