scholarly journals On the compositional checking of validity

1990 ◽  
Vol 19 (324) ◽  
Author(s):  
Glynn Winskel
Keyword(s):  
Modal Logic ◽  
Level Structure ◽  
Parallel Process ◽  
The Other ◽  
Reachable State ◽  
Compositional Reasoning ◽  
Parallel Processes ◽  
Special Cases ◽  
Finite State ◽  
State Language

This paper is concerned with deciding whether or not assertions are valid of a parallel process using methods which are directed by the way in which the process has been composed. The assertions are drawn from a modal logic with recursion, capable of expressing a great many properties of interest. The processes are described by a language inspired by Milner's CCS and Hoare's CSP, though with some modifications. The choice of constructors allows us to handle a range of synchronisation disciplines and ensures that the processes denoted are finite state. The operations are prefixing, a non-deterministic sum, product, restriction, relabelling and a looping construct. Arbitrary parallel compositions are obtained by using a combination of product, restriction and relabelling. We are interested in deciding whether or not an assertion A is valid of a process t. If it is valid, in the sense that every reachable state of t satisfies A, we write |= A:t. This paper investigates the extent to which the composition of t can guide methods for deciding |= A:t. For instance if t were a sum t_0 + t_1 we can ask what assertions A_0 and A_1 should be valid of t_0 and t_1 respectively to ensure that A is valid of t_0 + t_1. The paper formulates new compositional methods for deciding validity, and exposes some fundamental difficulties. Algorithms are provided to reduce validity problems for prefixing, sum, relabelling, restriction and looping to validity problems for their immediate components --- all these reductions depend only on the top-level structure of terms. The existence of these reductions rests on being able to 'embed' the properties of a term in the properties, or products of properties, of its immediate subterms. Because there is not such a simple embedding for the product construction of terms, as might be expected, similar reductions become much more complicated for products; although there are general results, and the reductions can be simple in special cases, the general treatment for products meets with fundamental difficulties. Whereas reductions for products always exist for this finite state language, they demonstrably no longer just depend on the top-level (product structure) of the term; in particular, a simple assertion is exhibited for which the size of the reduction must be quadratic in the number of states of the process. An attempt is thus made to explain what makes product different from the other operations with respect to compositional reasoning, and to delimit the obstacles to automated compositional checking of validity on parallel processes.

scholarly journals Leader-chasing behavior in negative artificial triggered lightning flashes

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Fukun Wang ◽  
Jianguo Wang ◽  
Li Cai ◽  
Rui Su ◽  
Wenhan Ding ◽  
...  
Keyword(s):  
High Speed ◽  
The Other ◽  
Lightning Flash ◽  
High Speed Camera ◽  
Return Stroke ◽  
Catching Up ◽  
Special Cases ◽  
Triggered Lightning

AbstractTwo special cases of dart leader propagation were observed by the high-speed camera in the leader/return stroke sequences of a classical triggered lightning flash and an altitude-triggered lightning flash, respectively. Different from most of the subsequent return strokes preceded by only one leader, the return stroke in each case was preceded by two leaders occurring successively and competing in the same channel, which herein is named leader-chasing behavior. In one case, the polarity of the latter leader was opposite to that of the former leader and these two combined together to form a new leader, which shared the same polarity with the former leader. In the other case, the latter leader shared the same polarity with the former leader and disappeared after catching up with the former leader. The propagation of the former leader in this case seems not to be significantly influenced by the existence of the latter leader.

scholarly journals Well-definedness and observational equivalence for inductive–coinductive programs

2019 ◽  
Vol 29 (4) ◽  
pp. 419-468
Author(s):  
Henning Basold ◽  
Helle Hvid Hansen
Keyword(s):  
Fixed Point ◽  
Modal Logic ◽  
The Other ◽  
Observational Equivalence ◽  
Other Hand ◽  
Inductive Types ◽  
Point Types ◽  
Usual Topology

Abstract We define notions of well-definedness and observational equivalence for programs of mixed inductive and coinductive types. These notions are defined by means of tests formulas which combine structural congruence for inductive types and modal logic for coinductive types. Tests also correspond to certain evaluation contexts. We define a program to be well-defined if it is strongly normalizing under all tests, and two programs are observationally equivalent if they satisfy the same tests. We show that observational equivalence is sufficiently coarse to ensure that least and greatest fixed point types are initial algebras and final coalgebras, respectively. This yields inductive and coinductive proof principles for reasoning about program behaviour. On the other hand, we argue that observational equivalence does not identify too many terms, by showing that tests induce a topology that, on streams, coincides with usual topology induced by the prefix metric. As one would expect, observational equivalence is, in general, undecidable, but in order to develop some practically useful heuristics we provide coinductive techniques for establishing observational normalization and observational equivalence, along with up-to techniques for enhancing these methods.

Extremely undecidable sentences

1982 ◽  
Vol 47 (1) ◽  
pp. 191-196 ◽  
Author(s):  
George Boolos
Keyword(s):  
Modal Logic ◽  
The Other ◽  
Propositional Modal Logic ◽  
Image Position

Let ‘ϕ’, ‘χ’, and ‘ψ’ be variables ranging over functions from the sentence letters P0, P1, … Pn, … of (propositional) modal logic to sentences of P(eano) Arithmetic), and for each sentence A of modal logic, inductively define Aϕ by[and similarly for other nonmodal propositional connectives]; andwhere Bew(x) is the standard provability predicate for PA and ⌈F⌉ is the PA numeral for the Gödel number of the formula F of PA. Then for any ϕ, (−□⊥)ϕ = −Bew(⌈⊥⌉), which is the consistency assertion for PA; a sentence S is undecidable in PA iff both and , where ϕ(p0) = S. If ψ(p0) is the undecidable sentence constructed by Gödel, then ⊬PA (−□⊥→ −□p0 & − □ − p0)ψ and ⊢PA(P0 ↔ −□⊥)ψ. However, if ψ(p0) is the undecidable sentence constructed by Rosser, then the situation is the other way around: ⊬PA(P0 ↔ −□⊥)ψ and ⊢PA (−□⊥→ −□−p0 & −□−p0)ψ. We call a sentence S of PA extremely undecidable if for all modal sentences A containing no sentence letter other than p0, if for some ψ, ⊬PAAψ, then ⊬PAAϕ, where ϕ(p0) = S. (So, roughly speaking, a sentence is extremely undecidable if it can be proved to have only those modal-logically characterizable properties that every sentence can be proved to have.) Thus extremely undecidable sentences are undecidable, but neither the Godel nor the Rosser sentence is extremely undecidable. It will follow at once from the main theorem of this paper that there are infinitely many inequivalent extremely undecidable sentences.

scholarly journals Copyful Streaming String Transducers

2021 ◽  
Vol 178 (1-2) ◽  
pp. 59-76
Author(s):  
Emmanuel Filiot ◽  
Pierre-Alain Reynier
Keyword(s):  
Polynomial Time ◽  
Equivalence Problem ◽  
Expressive Power ◽  
The Other ◽  
Finite State Automata ◽  
Finite State ◽  
Variable Content ◽  
Deterministic Automata ◽  
Intermediate Output ◽  
Linear Manner

Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. Černý in 2010 as a one-way deterministic automata model to define transductions of finite strings. Copyless SST extend deterministic finite state automata with a set of variables in which to store intermediate output strings, and those variables can be combined and updated all along the run, in a linear manner, i.e., no variable content can be copied on transitions. It is known that copyless SST capture exactly the class of MSO-definable string-to-string transductions, and are as expressive as deterministic two-way transducers. They enjoy good algorithmic properties. Most notably, they have decidable equivalence problem (in PSpace). On the other hand, HDT0L systems have been introduced for a while, the most prominent result being the decidability of the equivalence problem. In this paper, we propose a semantics of HDT0L systems in terms of transductions, and use it to study the class of deterministic copyful SST. Our contributions are as follows: (i)HDT0L systems and total deterministic copyful SST have the same expressive power, (ii)the equivalence problem for deterministic copyful SST and the equivalence problem for HDT0L systems are inter-reducible, in quadratic time. As a consequence, equivalence of deterministic SST is decidable, (iii)the functionality of non-deterministic copyful SST is decidable, (iv)determining whether a non-deterministic copyful SST can be transformed into an equivalent non-deterministic copyless SST is decidable in polynomial time.

The Circular Cylinder With a Band of Uniform Pressure on a Finite Length of the Surface

1941 ◽  
Vol 8 (3) ◽  
pp. A97-A104 ◽  
Author(s):  
M. V. Barton
Keyword(s):  
Circular Cylinder ◽  
Finite Length ◽  
Infinite Series ◽  
Fundamental Problem ◽  
The Other ◽  
Complete Picture ◽  
Uniform Pressure ◽  
Uniform Tension ◽  
Special Cases ◽  
Stress And Deformation

Abstract The solution to the fundamental problem of a cylinder with a uniform pressure over one half its length and a uniform tension on the other half is found by using the Papcovitch-Neuber solution to the general equations. In this paper, the results, given analytically in terms of infinite-series expressions, are exhibited as curves giving a complete picture of the stress and deformation. The case of a cylinder with a band of uniform pressure of any length, with the exception of very small ones, is then solved by the method of superposition. The stresses and displacements are evaluated for the special cases of a cylinder with a uniform pressure load of 1 diam and 1/2 diam in length. The problem of a cylinder heated over one half its length is solved by the same means.

scholarly journals A Conflict Tolerant Logic of Explicit Evidence

2021 ◽  
Vol 27 (1) ◽  
pp. 124-144
Author(s):  
Thomas Studer
Keyword(s):  
Modal Logic ◽  
Quantum Physics ◽  
Thought Experiment ◽  
The Other ◽  
Justification Logic ◽  
Epistemic Modal ◽  
Epistemic Reasoning ◽  
Basic Properties

Standard epistemic modal logic is unable to adequately deal with the FrauchigerRenner paradox in quantum physics. We introduce a novel justification logic CTJ, in which the paradox can be formalized without leading to an inconsistency. Still CTJ is strong enough to model traditional epistemic reasoning. Our logic tolerates two different pieces of evidence such that one piece justifies a proposition and the other piece justifies the negation of that proposition. However, our logic disallows one piece of evidence to justify both a proposition and its negation. We present syntax and semantics for CTJ and discuss its basic properties. Then we give an example of epistemic reasoning in CTJ that illustrates how the different principles of CTJ interact. We continue with the formalization of the Frauchiger–Renner thought experiment and discuss it in detail. Further, we add a trust axiom to CTJ and again discuss epistemic reasoning and the paradox in this extended setting.

scholarly journals The dissolution of the history of religions: Contemporary challenges of a humanities discipline in Sweden

2015 ◽  
Vol 51 (2) ◽  
pp. 161-75
Author(s):  
David Thurfjell
Keyword(s):  
The Other ◽  
Political Climate ◽  
Social Relevance ◽  
Parallel Processes ◽  
University Politics ◽  
History Of Religions ◽  
History Of ◽  
The One

The discipline of History of religions has changed in Sweden over the latest decades. Its traditional connection to text and language has weakened and its emphasis shifted towards social and contemporary aspects of religion. In this article the societal trends and the reforms in Swedish university politics that lie behind this change are pinpointed and discussed. It is argued that the transformation has been twofold. On the one hand the discipline has grown considerably and expanded into empirical fields, methods, and theories that were alien to it only twenty-five years ago. On the other it has been forced to adjust to a political climate focused on direct social relevance, measurability, and quantifiable efficiency. The article presents the transformation as consisting in four parallel processes labelled the efficiency turn, the altered knowledge contract, the replacement by religionsvetenskap, and the loss of prestige, respectively.

Tandem Conveyor Queues

1989 ◽  
Vol 3 (4) ◽  
pp. 517-536
Author(s):  
F. Baccelli ◽  
E.G. Coffman ◽  
E.N. Gilbert
Keyword(s):  
Boundary Value Problem ◽  
Joint Distribution ◽  
Queueing System ◽  
The Other ◽  
Riemann Boundary Value Problem ◽  
Riemann Boundary ◽  
Special Cases ◽  
A Cell ◽  
Service Times ◽  
Input Position

This paper analyzes a queueing system in which a constant-speed conveyor brings new items for service and carries away served items. The conveyor is a sequence of cells each able to hold at most one item. At each integer time, a new cell appears at the queue's input position. This cell holds an item requiring service with probability a, holds a passerby requiring no service with probability b, and is empty with probability (1– a – b). Service times are integers synchronized with the arrival of cells at the input, and they are geometrically distributed with parameter μ. Items requiring service are placed in an unbounded queue to await service. Served items are put in a second unbounded queue to await replacement on the conveyor in cells at the input position. Two models are considered. In one, a served item can only be placed into a cell that was empty on arrival; in the other, the served item can be placed into a cell that was either empty or contained an item requiring service (in the latter case unloading and loading at the input position can take place in the same time unit). The stationary joint distribution of the numbers of items in the two queues is studied for both models. It is verified that, in general, this distribution does not have a product form. Explicit results are worked out for special cases, e.g., when b = 0, and when all service times are one time unit (μ = 1). It is shown how the analysis of the general problem can be reduced to the solution of a Riemann boundary-value problem.

scholarly journals Inbreeding parents should invest more resources in fewer offspring

2016 ◽  
Author(s):  
A. Bradley Duthie ◽  
Aline M. Lee ◽  
Jane M. Reid
Keyword(s):  
General Theory ◽  
Evolutionary Dynamics ◽  
Inbreeding Avoidance ◽  
The Other ◽  
Trade Off ◽  
Offspring Number ◽  
Focal Female ◽  
Special Cases ◽  
Selection For ◽  
Joint Consideration

AbstractInbreeding increases parent-offspring relatedness and commonly reduces offspring viability, shaping selection on reproductive interactions involving relatives and associated parental investment (PI). Nevertheless, theories predicting selection for inbreeding versus inbreeding avoidance and selection for optimal PI have only been considered separately, precluding prediction of optimal PI and associated reproductive strategy given inbreeding. We unify inbreeding and PI theory, demonstrating that optimal PI increases when a female's inbreeding decreases the viability of her offspring. Inbreeding females should therefore produce fewer offspring due to the fundamental trade-off between offspring number and PI. Accordingly, selection for inbreeding versus inbreeding avoidance changes when females can adjust PI with the degree that they inbreed. In contrast, optimal PI does not depend on whether a focal female is herself inbred. However, inbreeding causes optimal PI to increase given strict monogamy and associated biparental investment compared to female-only investment. Our model implies that understanding evolutionary dynamics of inbreeding strategy, inbreeding depression, and PI requires joint consideration of the expression of each in relation to the other. Overall, we demonstrate that existing PI and inbreeding theories represent special cases of a more general theory, implying that intrinsic links between inbreeding and PI affect evolution of behaviour and intra-familial conflict.

Tsunamis

2017 ◽  
Author(s):  
John A. Adam
Keyword(s):  
Mathematical Model ◽  
Large Scale ◽  
Volcanic Eruptions ◽  
Ocean Waves ◽  
The Other ◽  
Tsunami Generation ◽  
Sea Waves ◽  
Tsunami Propagation ◽  
Tidal Waves ◽  
Special Cases

This chapter describes a mathematical model of tsunami propagation (transient waves). A tsunami is a series of ocean waves triggered by large-scale disturbances of the ocean, including earthquakes, as well as landslides, volcanic eruptions, and meteorites. Tsunamis have very long wavelengths (typically hundreds of kilometers). They have also been called “tidal waves” or “seismic sea waves,” but both terms are misleading. The chapter first considers the boundary-value problem before modeling two special cases of tsunami generation, one due to an initial displacement on the free surface and the other due to tilting of the seafloor. It also discusses surface waves on deep water and how fast the wave energy propagates and concludes with an analysis of leading waves due to a transient disturbance.

Sign in / Sign up

Export Citation Format

Share Document