This paper presents an extended system EPDL of propositional dynamic logic by allowing a proposition as a modality for representing and specifying direct and indirect effects of actions in a unified logical structure. A set of causal logics based on the framework are proposed to model causal propagations through logical relevancy and iterated effects of causation. It is shown that these logics ...

Justification Logic is the study of a family of logics used to reason about justified true belief. Dynamic Epistemic Logic is the study of a family of logics obtained by adding various kinds of communication to the language of multi-modal logic, yielding languages for reasoning about communication and true belief. This paper is a first-step in merging these two areas, in that it brings the most...

The general realization algorithm GRA is developed to identify modal parameters of linear multi-degree-of-freedom dynamic systems subjected to measured known arbitrary dynamic loading from known initial conditions. The GRA extends the well known eigensystem realization algorithm ERA based on Hankel matrix decomposition by allowing an arbitrary input signal in the realization algorithm. This gen...

In each case, the anaphorically related elements are italicized. In (1a), \a presentation" is the antecedent for the pronoun \it", and in (1b), \gave a presentation" is the antecedent for the VPE. Similarly, in (1c), we view the \past" in the rst clause as the antecedent for the \past" in the second clause. This links the time of leaving to the time of giving the presentation. In (1d), we regar...

Justification Logic is the study of a family of logics used to reason about justified true belief. Dynamic Epistemic Logic is the study of a family of logics obtained by adding various kinds of communication to the language of multi-modal logic, yielding languages for reasoning about communication and true belief. This paper is a first-step in merging these two areas, in that it brings the most...

The aim of this paper is to give new kinds of modal logics suitable for reasoning about regions in discrete spaces. We call them dynamic logics of the region-based theory of discrete spaces. These modal logics are linguistic restrictions of propositional dynamic logic with the global diamond E. Their formulas are equivalent to Boolean combinations of modal formulas like E(A ∧ 〈α〉B) where A and ...

Modal parameter extraction of high speed shafts is of critical importance in mechanical design of turbo-pumps. Due to the complex geometry and peripheral components of turbo-pumps, difficulties can arise in determination of modal parameters. In this study, modal properties of a turbo-pump shaft, was studied by experimental modal analysis, and using different excitation techniques. An innovative...

Propositional Dynamic Logic (PDL) is a multi-modal logic used for specifying and reasoning on sequential programs. Petri Net is a widely used formalism to specify and to analyse concurrent programs with a very nice graphical representation. In this work, we propose a PDL to reasoning about Petri Nets. First we define a compositional encoding of Petri Nets from basic nets as terms. Second, we us...

It is well known that Propositional Dynamic Logic (PDL) can be seen as a fragment of the modal μ-calculus. In this paper we provide an exact syntactic characterization of the fragments of the μ-calculus that correspond to PDL and to test-free PDL. In addition we give automata-theoretic characterizations for PDL, with and without tests, which shed light on the relation between these logics and t...

In this article the method of pricing the liabilities of a financial institution by means of dynamic mean–variance hedging is applied to the situation of an incomplete market that is nevertheless in equilibrium. For a given stochastic asset–liability model that is consistent with the market, the article shows how to determine a unique price at which, subject to specified provisos, a prospective...