Results 41 to 50 of about 1,036,043 (288)
We examine languages of unranked forests definable using the temporal operators EF and EX. We characterize the languages definable in this logic, and various fragments thereof, using the syntactic forest algebras introduced by Bojanczyk and Walukiewicz ...
H Straubing +3 more
core +1 more source
Seven strategies for tolerating highly defective fabrication [PDF]
In this article we present an architecture that supports fine-grained sparing and resource matching. The base logic structure is a set of interconnected PLAs. The PLAs and their interconnections consist of large arrays of interchangeable nanowires, which
DeHon, André, Naeimi, Helia
core +1 more source
Toward a probability theory for product logic: states, integral representation and reasoning
The aim of this paper is to extend probability theory from the classical to the product t-norm fuzzy logic setting. More precisely, we axiomatize a generalized notion of finitely additive probability for product logic formulas, called state, and show ...
Flaminio, Tommaso +2 more
core +1 more source
Model Checking Markov Chains with Actions and State Labels [PDF]
In the past, logics of several kinds have been proposed for reasoning about discrete- or continuous-time Markov chains. Most of these logics rely on either state labels (atomic propositions) or on transition labels (actions).
Baier, Christel +4 more
core +3 more sources
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
The vast quantity of data generated and captured every day has led to a pressing need for tools and processes to organize, analyze and interrelate this data.
Manolios, Panagiotis +2 more
core +3 more sources
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
On cascade products of answer set programs
Describing complex objects by elementary ones is a common strategy in mathematics and science in general. In their seminal 1965 paper, Kenneth Krohn and John Rhodes showed that every finite deterministic automaton can be represented (or "emulated") by a ...
Antić, Christian
core +1 more source
Digital twins to accelerate target identification and drug development for immune‐mediated disorders
Digital twins integrate patient‐derived molecular and clinical data into personalised computational models that simulate disease mechanisms. They enable rapid identification and validation of therapeutic targets, prediction of drug responses, and prioritisation of candidate interventions.
Anna Niarakis, Philippe Moingeon
wiley +1 more source
A Translation of Weighted LTL Formulas to Weighted Buchi Automata over omega-valuation Monoids
In this paper we introduce a weighted LTL over product omega-valuation monoids that satisfy specific properties. We also introduce weighted generalized Buchi automata with epsilon-transitions, as well as weighted Buchi automata with epsilon-transitions ...
Eleni Mandrali
doaj +1 more source

