Formal assessment of reliability specifications in embedded cyber-physical systems

Reliability has become an integral component of the design intent of embedded cyber-physical systems. Safety-critical embedded systems are designed with specific reliability targets, and design practices include the appropriate allocation of both spatial and temporal redundancies in the implementation to meet such requirements. With increasing complexity of such systems and considering the large number of components in such systems, redundancy allocation requires a formal scientific basis. In this work, we profess the analysis of the redundancy requirement upfront with the objective of making it an integral part of the specification. The underlying problem is one of synthesizing a formal specification with built-in redundancy artifacts, from the formal properties of the error-free system, the error probabilities of the control components, and the reliability target. We believe that upfront formal analysis of redundancy requirements is important in budgeting the resource requirements from a cost versus reliability perspective. Several case-studies from the automotive domain highlight the efficacy of our proposal.     

A multiple-valued logic approach to the design and verification of hardware circuits

We present a novel approach, which is based on multiple-valued logic (MVL), to the verification and analysis of digital hardware designs, which extends the common ternary or quaternary approaches for simulations. The simulations which are performed in the more informative MVL setting reveal details which are either invisible or harder to detect through binary or ternary simulations. In equivalence verification, detecting different behavior under MVL simulations may lead to the discovery of a genuine binary non-equivalence or to a qualitative gap between two designs. The value of a variable in a simulation may hold information about its degree of truth and its “place of birth” and “date of birth”. Applications include equivalence verification, initialization, assertions generation and verification, partial control on the flow of data by prioritizing and block-oriented simulations. Much of the paper is devoted to theoretical aspects behind the MVL approach, including the reason for choosing a specific algebra for computations and the introduction of the notions of De Morgan Canonical Form and of verification complexity of Boolean expressions. Two basic simulation-based algorithms are presented, one for satisfying and verifying combinational designs and the other for equivalence verification of sequential designs.     

Bunched sequential information

It is known that the logic BI of bunched implications is a logic of resources. Many studies have reported on the applications of BI to computer science. In this paper, an extension BIS of BI by adding a sequence modal operator is introduced and studied in order to formalize more fine-grained resource-sensitive reasoning. By the sequence modal operator of BIS, we can appropriately express “sequential information” in resource-sensitive reasoning. A Gentzen-type sequent calculus SBIS for BIS is introduced, and the cut-elimination and decidability theorems for SBIS are proved. An extension of the Grothendieck topological semantics for BI is introduced for BIS, and the completeness theorem with respect to this semantics is proved. The cut-elimination, decidability and completeness theorems for SBIS and BIS are proved using some theorems for embedding BIS into BI.     

Metamorphic malicious code behavior detection using probabilistic inference methods

Existing antivirus programs detect malicious code based on fixed signatures; therefore, they have limitations in detecting metamorphic malicious code that lacks signature information or possesses circumventing code inserted into it. Research on the methods for detecting this type of metamorphic malicious code primarily focuses on techniques that can detect code based on behavioral similarity to known malicious code. However, these techniques measure the degree of similarity with existing malicious code using API function call patterns. Therefore, they have certain disadvantages, such as low accuracy and large detection times. In this paper, we propose a method which can overcome the limitations of existing methods by using the FP-Growth algorithm, a data mining technique, and the Markov Logic Networks algorithm, a probabilistic inference method. To perform a comparative evaluation of the proposed method's malicious code behavior detection, we performed inference experiments using malicious code with an inserted code for random malicious behavior. We performed experiments to select optimal weights for each inference rule to improve our malicious code behavior inferences’ accuracy. The results of experiments, in which we performed a comparative evaluation with the General Bayesian Network, showed that the proposed method had an 8% higher classification performance.     

Parameter selection based on fuzzy logic to improve UAV path-following algorithms

In order to steer an Unmanned Aerial Vehicle (UAV) and make it follow a desired trajectory, a high level controller is needed. Depending on the control algorithm, one or more parameters have to be tuned, having their values high impact on the performance. In most of the works, these parameters are taken as constant. In this paper, we apply fuzzy logic to select the parameters of the control law and compare this approach with the tuning by constant parameters and with another adjusting method based on the kinematic analysis of the equations of the UAV. After many simulations of the quadrotor following randomly generated paths, we have proved that the fuzzy tuning law is not only a good and feasible solution, but also more general as it can be applied to any trajectory.     

Disagreements Over Analogies

This essay presents a dialogical framework for treating philosophical disagreements as persuasion dialogues with analogical argumentation, with the aim of recasting philosophical disputes as disagreements over analogies. This has two benefits: (1) it allows us to temporarily bypass conflicting metaphysical intuitions by focusing on paradigmatic examples, (dis)similarities, and the plausibility of conclusions for or against a given point of view; and (2) it can reveal new avenues of argumentation regarding a given issue. This approach to philosophical disagreements is illustrated by studying the role of argumentation by analogy in disputes over Lockean justifications of intellectual property rights, and disagreements over whether artificial agents should be treated as moral agents. Finally, a nonexhaustive list of possible global and local points of contention over analogical arguments is identified in order to highlight potential avenues of argumentation in disagreements over analogies.     

The four antinomies of the death instinct1

Matte Blanco examines four paradoxical positions that arise out of Freud's writings on the death instinct. He notes that death is not a content known to the unconscious. Furthermore, the absence of time and space in the unconscious means that the conditions necessary for any process such as instinct are similarly absent. Matte Blanco demonstrates the way in which the antinomies that he explores can be explained in terms of the logics that obtain in the unconscious, and he suggests that the concept of the death instinct is one of the most profound expressions of the relationship between the modes that underlie conscious and unconscious logic.     

从"炸药"到"伟哥"创新历程的启示--科学创新思维中的逻辑与直觉

国家的经济发展需要科学创新的成果,而创新的成果源自创新的思维.法国数学家彭加勒在谈到创新性的思维时说过:"逻辑用于论证,直觉用于发明",并提出了创造性的科学思维活动的"三段式"理论.从"炸药"到"伟哥"科学创新的百年历程中,去验证和探究彭加勒的科学哲学思维,以及这个理论中包含的逻辑与直觉的关系.     

Combinator Logics

Combinator logics are a broad family of substructual logics that are formed by extending the basic relevant logic B with axioms that correspond closely to the reduction rules of proper combinators in combinatory logic. In the Routley-Meyer relational semantics for relevant logic each such combinator logic is characterized by the class of frames that meet a first-order condition that also directly corresponds to the same combinator's reduction rule. A second family of logics is also introduced that extends B with the addition of propositional constants that correspond to combinators. These are characterized by relational frames that meet first-order conditions that reflect the structures of the combinators themselves.     

A Sequent Formulation of Conditional Logic Based on Belief Change Operations

Peter Gärdenfors has developed a semantics for conditional logic, based on the operations of expansion and revision applied to states of information. The account amounts to a formalisation of the Ramsey test for conditionals. A conditional A > B is declared accepted in a state of information K if B is accepted in the state of information which is the result of revising K with respect to A. While Gärdenfors's account takes the truth-functional part of the logic as given, the present paper proposes a semantics entirely based on epistemic states and operations on these states. The semantics is accompanied by a syntactic treatment of conditional logic which is formally similar to Gentzen's sequent formulation of natural deduction rules. Three of David Lewis's systems of conditional logic are represented. The formulations are attractive by virtue of their transparency and simplicity.