Results 61 to 70 of about 3,411 (291)
Advanced 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
Using formal methods to support testing [PDF]
, 2008 Formal methods and testing are two important approaches that assist in the development of high quality software. While traditionally these approaches have been seen as rivals, in recent years a new consensus has developed in which they are seen as ...
Woodward, M +13 more
core +5 more sources
Deciding the value 1 problem for probabilistic leaktight automata [PDF]
Logical Methods in Computer Science, 2015 The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1?
Nathanaël Fijalkow +3 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.A unified research data management framework for heterogeneous materials data is presented. The system integrates multimodal datasets using ontologies and knowledge graphs, enabling interoperability and FAIR (findable, accessible, interoperable, reusable) data principles. By linking data across scales and workflows, it supports reproducible, Artifitial
Doaa Mohamed +6 more
wiley +1 more source
Quantitative Languages Defined by Functional Automata [PDF]
Logical Methods in Computer Science, 2015 A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges
Emmanuel Filiot +2 more
doaj +1 more source
Functional Automata - Formal Languages for Computer Science Students [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidability. Programming students find these topics to be challenging or, in many cases, overwhelming and on the fringe of Computer Science.
Marco T. Morazán, Rosario Antunez
openaire +4 more sources
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
Advanced Engineering Materials, EarlyView.A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 more
wiley +1 more source
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages [PDF]
Logical Methods in Computer ScienceA characteristic sample for a language $L$ and a learning algorithm $\textbf{L}$ is a finite sample of words $T_L$ labeled by their membership in $L$ such that for any sample $T \supseteq T_L$ consistent with $L$, on input $T$ the learning algorithm ...
Dana Angluin, Dana Fisman
doaj +1 more source
A Knowledge‐Based Approach for Understanding and Managing Additive Manufacturing Data
Advanced Engineering Materials, EarlyView.Additive manufacturing processes generate a large amount of data. Effectively managing, understanding, and retrieving information from this data remains a major challenge. Therefore, we propose an ontology‐based approach to integrate heterogeneous data, enable semantic queries, and support decision‐making.
Mina Abd Nikooie Pour +5 more
wiley +1 more source
Structural Reductions and Stutter Sensitive Properties [PDF]
Logical Methods in Computer ScienceVerification of properties expressed as $\omega$-regular languages such as LTL can benefit hugely from stutter insensitivity, using a diverse set of reduction strategies.
Emmanuel Paviot-Adet +3 more
doaj +1 more source