Results 151 to 160 of about 133,366 (251)
Higher-Dimensional Timed Automata
International audienceWe introduce a new formalism of higher-dimensional timed automata, based on van Glabbeek's higher-dimensional automata and Alur's timed automata.
Fahrenberg, Uli
core +1 more source
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Golovach PA, Zehavi M.
europepmc +1 more source
A Lightweight Procedural Layer for Hybrid Experimental–Computational Workflows in Materials Science
We unveil a prototype hybrid‐workflow framework that fuses automatedcomputation with hands‐on experiments. Built atop pyiron, a lightweight, parameterized layer translates procedure descriptions into executable manual steps, syncing instrument settings, human interventions, and data capture in real‐time today.
Steffen Brinckmann +8 more
wiley +1 more source
Timed Automata with Periodic Clock Constraints
The traditional constraints on the clocks of a timed automaton are based on real intervals, e. g., the value of a clock belongs to the interval (0; 1).
Massimiliano Goldwurm +3 more
core
PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science
Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley +1 more source
Current Status and Challenges in Data Collection for Aerospace Coatings Deposited by Plasma Spraying
An innovative approach has been integrated into the GRENAT project to optimize plasma spraying and coating performance. Raw materials are accelerated and melted in the plasma generated by torches, creating coatings. Monitoring sensors collect process data which are combined with ex situ characterization data.
Lila Randriamananjara +8 more
wiley +1 more source
We study the class of timed automata called eventual timed automata (ETA's) obtained using guards based on the operator lozenge. In this paper we show that ETA's form a decidable class of timed automata via a flattening to non-recursive ETA's followed by
Raj, Mohan M, DSouza, Deepak
core

