Results 61 to 70 of about 6,826 (311)

A derivation-loop method for temporal logic

open access: yesLietuvos Matematikos Rinkinys, 2019
Various types of calculi (Hilbert, Gentzen sequent, resolution calculi, tableaux) for propositional linear temporal logic (PLTL) have been considered in the literature.
Romas Alonderis, Haroldas Giedra
doaj   +1 more source

NFDI MatWerk Ontology (MWO): A BFO‐Compliant Ontology for Research Data Management in Materials Science and Engineering

open access: yesAdvanced Engineering Materials, EarlyView.
This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi   +4 more
wiley   +1 more source

Modular Construction of Modal Logics

open access: yes, 2004
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems.
Pattinson, Dirk   +3 more
core   +1 more source

The Temporal Logic Sugar [PDF]

open access: yes, 2001
Since the introduction of temporal logic for the specification of computer programs [5], usability has been an issue, because a difficult-to-use formalism is a barrier to the wide adoption of formal methods. Our solution is Sugar, the temporal logic used by the RuleBase formal verification tool [2]. Sugar adds the power of regular expressions to CTL [4]
Ilan Beer   +5 more
openaire   +1 more source

Soft Mechanical‐Electrical Logic Using Liquid Metal‐Filled 3D‐Printed Architectures

open access: yesAdvanced Engineering Materials, EarlyView.
We present 3D‐printed soft mechanical–electrical logic elements that use liquid metal–filled silicone tubes actuated by thermoplastic polyurethane/polylactic acid (TPU/PLA) architectures to produce Boolean operations. Complementary normally open and normally closed unit cells perform repeatable binary transitions and can be combined into more complex ...
Christoph Lehmann   +2 more
wiley   +1 more source

Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics

open access: yes, 2010
This paper gives a general coalgebraic account of the notions of possibly infinite trace and possibly infinite execution in state-based, dynamical systems, by extending the generic theory of finite traces and executions developed by Hasuo and coauthors ...
Cirstea, Corina, Corina Cîrstea
core   +1 more source

All‐in‐One Analog AI Hardware: On‐Chip Training and Inference with Conductive‐Metal‐Oxide/HfOx ReRAM Devices

open access: yesAdvanced Functional Materials, EarlyView.
An all‐in‐one analog AI accelerator is presented, enabling on‐chip training, weight retention, and long‐term inference acceleration. It leverages a BEOL‐integrated CMO/HfOx ReRAM array with low‐voltage operation (<1.5 V), multi‐bit capability over 32 states, low programming noise (10 nS), and near‐ideal weight transfer.
Donato Francesco Falcone   +11 more
wiley   +1 more source

Method of marks for propositional linear temporal logic

open access: yesLietuvos Matematikos Rinkinys, 2014
It is known that traditional techniques used to ensure termination of a decision procedure in non-classical logics are based on loop-checking, in general.
Regimantas Pliuškevičius
doaj   +1 more source

Integration of Low‐Voltage Nanoscale MoS2 Memristors on CMOS Microchips

open access: yesAdvanced Functional Materials, EarlyView.
This article presents the first monolithic integration of nanoscale MoS2‐based memristors into the back‐end‐of‐line of foundry‐fabricated CMOS microchips in a one‐transistor‐one‐resistor (1T1R) architecture. The MoS2‐based 1T1R cells exhibit forming‐free, nonvolatile resistive switching with ultra‐low operating voltages, low cycle‐to‐cycle variability ...
Jimin Lee   +16 more
wiley   +1 more source

Cut, invariant rule, and loop-check free sequent calculus for PLTL

open access: yesLietuvos Matematikos Rinkinys, 2011
In this paper, some loop-check free saturation-like decision procedure is proposed for propositional linear temporal logic (PLTL) with temporal operators “next” and “always”.
Romas Alonderis   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy