Results 51 to 60 of about 17,423 (281)
Bounded Determinization of Timed Automata with Silent Transitions
Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable.
A Biere +14 more
core +1 more source
Latency Evaluation of SDFGs on Heterogeneous Processors Using Timed Automata
Synchronous Data Flow (SDF) is a graphical computation model used for analyzing digital signal processing and real time multimedia applications. In general, these applications have two primary performance metrics - throughput and latency.
Sivashankari Rajadurai +3 more
doaj +1 more source
Timed Automata Semantics for Analyzing Creol [PDF]
We give a real-time semantics for the concurrent, object-oriented modeling language Creol, by mapping Creol processes to a network of timed automata. We can use our semantics to verify real time properties of Creol objects, in particular to see whether ...
Mohammad Mahdi Jaghoori, Tom Chothia
doaj +1 more source
A Note on Fault Diagnosis Algorithms [PDF]
In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) B\"uchi automata.
Cassez, Franck
core +4 more sources
Dynamic Timed Automata for Reconfigurable System Modeling and Verification
Modern discrete-event systems (DESs) are often characterized by their dynamic structures enabling highly flexible behaviors that can respond in real time to volatile environments.
Samir Tigane +5 more
doaj +1 more source
The ubiquitin ligase RNF115 is required for the clearance of damaged lysosomes
Upon lysosomal rupture, an E3 ubiquitin ligase RNF115 translocates from the cytosol to the damaged lysosomal membrane. Moreover, RNF115 depletion impairs the clearance of damaged lysosomes, identifying it as a key regulator of lysosomal quality control.
Sae Nakanaga +3 more
wiley +1 more source
Model Checking One-clock Priced Timed Automata [PDF]
We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical ...
Patricia Bouyer +2 more
doaj +1 more source
Single circulating tumor cells (sCTCs) from high‐grade serous ovarian cancer patients were enriched, imaged, and genomically profiled using WGA and NGS at different time points during treatment. sCTCs revealed enrichment of alterations in Chromosomes 2, 7, and 12 as well as persistent or emerging oncogenic CNAs, supporting sCTC identity.
Carolin Salmon +9 more
wiley +1 more source
Timed Concurrent State Machines
Timed Concurrent State Machines are an application of Alur Timed Automata concept tocoincidence-based (rather than interleaving) CSM modeling technique.
Wiktor B. Daszczuk
doaj +1 more source
Language Preservation Problems in Parametric Timed Automata [PDF]
Parametric timed automata (PTA) are a powerful formalism to model and reason about concurrent systems with some unknown timing delays. In this paper, we address the (untimed) language- and trace-preservation problems: given a reference parameter ...
Étienne André +2 more
doaj +1 more source

