Results 61 to 70 of about 17,423 (281)

Testing membership for timed automata

open access: yesActa Informatica, 2023
26 ...
Richard Lassaigne, Michel de Rougemont
openaire   +2 more sources

TRAIL‐PEG‐Apt‐PLGA nanosystem as an aptamer‐targeted drug delivery system potential for triple‐negative breast cancer therapy using in vivo mouse model

open access: yesMolecular Oncology, EarlyView.
Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat   +8 more
wiley   +1 more source

Timed Automata Semantics for Visual e-Contracts [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
C-O Diagrams have been introduced as a means to have a more visual representation of electronic contracts, where it is possible to represent the obligations, permissions and prohibitions of the different signatories, as well as what are the penalties in ...
Enrique Martínez   +3 more
doaj   +1 more source

Parameterized Model-Checking for Timed-Systems with Conjunctive Guards (Extended Version)

open access: yes, 2014
In this work we extend the Emerson and Kahlon's cutoff theorems for process skeletons with conjunctive guards to Parameterized Networks of Timed Automata, i.e.
A Bouajjani   +17 more
core   +1 more source

Genetic attenuation of ALDH1A1 increases metastatic potential and aggressiveness in colorectal cancer

open access: yesMolecular Oncology, EarlyView.
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova   +25 more
wiley   +1 more source

Behavioural equivalences for timed systems [PDF]

open access: yesLogical Methods in Computer Science, 2019
Timed transition systems are behavioural models that include an explicit treatment of time flow and are used to formalise the semantics of several foundational process calculi and automata. Despite their relevance, a general mathematical characterisation
Tomasz Brengos, Marco Peressotti
doaj   +1 more source

COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells

open access: yesMolecular Oncology, EarlyView.
This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos   +6 more
wiley   +1 more source

Language Emptiness of Continuous-Time Parametric Timed Automata

open access: yes, 2015
Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even for various ...
Aleksandra Jovanović   +14 more
core   +1 more source

Interrupt Timed Automata [PDF]

open access: yes, 2009
In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single processor environment. This model is a subclass of hybrid automata. While reachability is undecidable for hybrid automata we show that in ITA the reachability problem is in 2EXPSPACE and ...
Bérard, Béatrice, Haddad, Serge
openaire   +2 more sources

Linear-Time Limited Automata [PDF]

open access: yesTheoretical Computer Science, 2018
The time complexity of 1-limited automata is investigated from a descriptional complexity view point. Though the model recognizes regular languages only, it may use quadratic time in the input length. We show that, with a polynomial increase in size and preserving determinism, each 1-limited automaton can be transformed into an halting linear-time ...
Bruno Guillon, Luca Prigioniero
openaire   +7 more sources

Home - About - Disclaimer - Privacy