Results 101 to 110 of about 17,423 (281)

On MITL and alternating timed automata over infinite words

open access: yes, 2014
One clock alternating timed automata (OCATA) have been introduced as natural extension of (one clock) timed automata to express the semantics of MTL. In this paper, we consider the application of OCATA to the problems of model-checking and satisfiability
Brihaye, Thomas   +2 more
core   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

open access: yesFEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill   +4 more
wiley   +1 more source

Timed k-Tail: Automatic Inference of Timed Automata

open access: yes, 2017
Accurate and up-to-date models describing the be- havior of software systems are seldom available in practice. To address this issue, software engineers may use specification mining techniques, which can automatically derive models that capture the ...
Mariani, Leonardo   +2 more
core   +1 more source

Pharmacological inhibition of the PERK pathway modulates hepatocellular carcinoma growth and immune signaling

open access: yesFEBS Open Bio, EarlyView.
Pharmacological inhibition of PERK in a DEN‐induced mouse model of liver cancer does not reduce tumor burden but alters cellular stress signaling. Despite blocking PERK activity, downstream stress responses, including CHOP expression, remain active, suggesting compensatory mechanisms within the unfolded protein response that may influence tumor ...
Ada Lerma‐Clavero   +5 more
wiley   +1 more source

MONAA: A Tool for Timed Pattern Matching with Automata-Based Acceleration

open access: yes, 2018
We present monaa, a monitoring tool over a real-time property specified by either a timed automaton or a timed regular expression. It implements a timed pattern matching algorithm that combines 1) features suited for online monitoring, and 2 ...
Hasuo, Ichiro   +2 more
core   +1 more source

On MITL and Alternating Timed Automata [PDF]

open access: yes, 2013
One clock alternating timed automata OCATA have been recently introduced as natural extension of (one clock) timed automata to express the semantics of MTL (Ouaknine, Worrell 2005). We consider the application of OCATA to problem of model-checking MITL formulas (a syntactic fragment of MTL) against timed automata. We introduce a new semantics for OCATA
Brihaye, Thomas   +2 more
openaire   +3 more sources

RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells

open access: yesFEBS Open Bio, EarlyView.
RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour   +2 more
wiley   +1 more source

Remote Monitoring in Myasthenia Gravis: Exploring Symptom Variability

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Myasthenia gravis (MG) is a rare, autoimmune disorder characterized by fluctuating muscle weakness and potential life‐threatening crises. While continuous specialized care is essential, access barriers often delay timely interventions. To address this, we developed MyaLink, a telemedical platform for MG patients.
Maike Stein   +13 more
wiley   +1 more source

Dynamic Data Structures for Timed Automata Acceptance. [PDF]

open access: yesAlgorithmica, 2022
Grez A   +4 more
europepmc   +1 more source

Higher-Dimensional Timed Automata

open access: yes, 2018
We introduce a new formalism of higher-dimensional timed automata, based on van Glabbeek's higher-dimensional automata and Alur's timed automata. We prove that their reachability is PSPACE-complete and can be decided using zone-based algorithms.
Fahrenberg, Uli
core  

Home - About - Disclaimer - Privacy