Weighted Markov decision processes (MDPs) have long been used to model quantitative aspects of systems in the presence of uncertainty. However, much of the literature on such MDPs takes a monolithic approach, by model...
详细信息
Weighted Markov decision processes (MDPs) have long been used to model quantitative aspects of systems in the presence of uncertainty. However, much of the literature on such MDPs takes a monolithic approach, by modelling a system as a particular MDP;properties of the system are then inferred by analysis of that particular MDP. In contrast in this paper we develop compositional methods for reasoning about weighted MDPs, as a possible basis for compositional reasoning about their quantitative behaviour. In particular we approach these systems from a process algebraic point of view. For these we define a coinductive simulation-based behavioural preorder which is compositional in the sense that it is preserved by structural operators for constructing weighted MDPs from components. For finitary convergent processes, which are finite-state and finitely branching systems without divergence, we provide two characterisations of the behavioural preorder. the first uses a novel quantitative probabilistic logic, while the second is in terms of a novel form of testing, in which benefits are accrued during the execution of tests. (C) 2013 Elsevier B.V. All rights reserved.
the proceedings contain 51 papers. the special focus in this conference is on theory and Practice of Software Development. the topics include: Goldilocks and the three specifications;on relating some models for concur...
ISBN:
(纸本)9783540566106
the proceedings contain 51 papers. the special focus in this conference is on theory and Practice of Software Development. the topics include: Goldilocks and the three specifications;on relating some models for concurrency;compositionality results for different types of parameterization and parameter passing in specification languages;proving ground confluence and inductive validity in constructor based equational specifications;associative-commutative discrimination nets;algebraic specification and development in geometric modelling;a case study in transformational design of concurrent systems;a case study for a practical use of formal methods;verification and comparison of transition systems;constraining interference in an object-based design method;hyperedge replacement with rendezvous;true concurrency semantics for a linear logicprogramming language with broadcast communication;a general framework for modular implementations of modular system specifications;specifications can make programs run faster;application of the composition principle to unity-like specifications;trees, ordinals and termination;automata on infinite trees with counting constraints;directed column-convex polyominoes by recurrence relations;object organisation in software environments for formal methods;monads, indexes and transformations;a technique for specifying and refining TCSP processes by using guards and liveness conditions;applications of type theory;feature automata and recognizable sets of feature trees;about the theory of tree embedding;linear unification of higher-order patterns;a theory of requirements capture and its applications;exception handling and term labelling;gate splitting in LOTOS specifications using abstract interpretation and constructing systems as object communities.
the proceedings contain 45 papers. the special focus in this conference is on Analogical and Inductive Inference. the topics include: Deductive plan generation;average case analysis of pattern language learning algori...
ISBN:
(纸本)9783540585206
the proceedings contain 45 papers. the special focus in this conference is on Analogical and Inductive Inference. the topics include: Deductive plan generation;average case analysis of pattern language learning algorithms;enumerable classes of total recursive functions;derived sets and inductive inference;therapy plan generation as program synthesis;a calculus for logical clustering;learning with higher order additional information;efficient learning of regular expressions from good examples;identifying nearly minimal Gödel numbers from additional information;on case-based represent ability and learnability of languages;rule-generating abduction for recursive prolog;fuzzy analogy based reasoning and classification of fuzzy analogies;explanation-based reuse of prolog programs;constructive induction for recursive programs;training digraphs;towards realistic theories of learning;a unified approach to inductive logic and case-based reasoning;three decades of team learning;on-line learning with malicious noise and the closure algorithm;learnability with restricted focus of attention guarantees noise-tolerance;efficient algorithm for learning simple regular expressions from noisy examples;a note on learning DNF formulas using equivalence and incomplete membership queries;identifying regular languages over partially-commutative monoids;classification using information;learning from examples with typed equational programming;finding tree patterns consistent with positive and negative examples using queries;program synthesis in the presence of infinite number of inaccuracies;language learning under various types of constraint combinations and monotonicity versus efficiency for learning languages from texts.
We illustrate the use of a declarative programming paradigm based upon three kinds of program clauses: equational, subset, and general relational clauses. the implemented language is called SURE, which is an acronym f...
详细信息
this paper contributes to a line of research which aims to combine numerical information withlogical inference in order to find the most likely states of a biological system under various (actual or hypothetical) con...
详细信息
Existing linearized section location methods for distribution networks are only applicable to single faults. In response, this paper proposes a linear integer programming method for section location in distribution ne...
详细信息
ISBN:
(数字)9798331532765
ISBN:
(纸本)9798331532772
Existing linearized section location methods for distribution networks are only applicable to single faults. In response, this paper proposes a linear integer programming method for section location in distribution networks that is suitable for multiple faults. Firstly, based on fault-tolerant mechanism analysis, a switch function tailored for multiple faults is developed. Secondly, the method incorporates phasor measurement unit (PMU) information fault information into the section location process, constructing a logical model for section location in distribution networks. Finally, by applying three transformation principles between logical and algebraic relationships, the logical model is converted into a linear integer programming model, which is solved using MATLAB+CPLEX. Case studies demonstrate that the proposed linear integer programming method for section location in distribution networks achieves fast location speed and robust fault tolerance, making it suitable for both single and multiple faults.
暂无评论