Results 21 to 30 of about 1,711 (143)
Efficient Algorithms for Morphisms over Omega-Regular Languages [PDF]
, 2015 Morphisms to finite semigroups can be used for recognizing omega-regular languages. The so-called strongly recognizing morphisms can be seen as a deterministic computation model which provides minimal objects (known as the syntactic morphism) and a ...
Fleischer, Lukas, Kufleitner, Manfred
core +3 more sources
A Component-oriented Framework for Autonomous Agents [PDF]
, 2017 The design of a complex system warrants a compositional methodology, i.e., composing simple components to obtain a larger system that exhibits their collective behavior in a meaningful way.
C Baier +14 more
core +6 more sources
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata
, 2020 In the mid 80s, Lichtenstein, Pnueli, and Zuck proved a classical theorem stating that every formula of Past LTL (the extension of LTL with past operators) is equivalent to a formula of the form $\bigwedge_{i=1}^n \mathbf{G}\mathbf{F} \varphi_i \vee ...
Brunner Julian +12 more
core +1 more source
ON THE PROBLEM OF LOGIC-AUTOMATIC FORMULAS PERFORMABILITY
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2020 Background. In the theory of finite automata, there are a number of ways to define finite automata (finitely automatic functions). There are systems of canonical equations among them, Moore diagrams, information trees, schemes of automatic elements ...
S. S. Marchenkov
doaj +1 more source
Wadge Degrees of $\omega$-Languages of Petri Nets
, 2018 We prove that $\omega$-languages of (non-deterministic) Petri nets and $\omega$-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of $\omega$-languages of (non ...
Finkel, Olivier
core +1 more source
On finitely ambiguous B\"uchi automata
, 2018 Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking.
A Arnold +14 more
core +1 more source
Mightyl: A compositional translation from mitl to timed automata [PDF]
, 2017 Metric Interval Temporal Logic (MITL) was first proposed in the early 1990s as a specification formalism for real-time systems. Apart from its appealing intuitive syntax, there are also theoretical evidences that make MITL a prime real-time counterpart ...
A Cimatti +28 more
core +3 more sources
Rabin vs. Streett Automata [PDF]
, 2018 The Rabin and Streett acceptance conditions are dual. Accordingly, deterministic Rabin and Streett automata are dual. Yet, when adding nondeterminsim, the picture changes dramatically.
Boker, Udi
core +1 more source
Advanced Science, EarlyView.Active lithium loss (ALL) and capacity fade can be compensated by prelithiation, apparently simple via sacrificing additives e.g., lithium squarates. However, as a cathode additive it ruptures the cathode via gas evolution, while as an electrolyte additive it gets reductively depleted on anode side in course of solid electrolyte interphase (SEI ...
Ibrahim Lawan Abdullahi +8 more
wiley +1 more source
Advanced Energy Materials, EarlyView.This study investigates the feasibility of scaling up Prussian White (PW)‐based cathode manufacturing at a pilot scale. Through careful PW dehydration combined with optimized aqueous processing, we report the stepwise development of industrially relevant 1 Ah pouch cells and evaluate their performance under various conditions.
Faduma M. Maddar +7 more
wiley +1 more source