Results 41 to 50 of about 1,133,638 (315)
Model Checking in Bits and Pieces [PDF]
Fully automated verification of concurrent programs is a difficult problem, primarily because of state explosion: the exponential growth of a program state space with the number of its concurrently active components.
Kedar S. Namjoshi
doaj +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
Parse trees are fundamental syntactic structures in both computational linguistics and compilers construction. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word according to a ...
Boral, Anudhyan, Schmitz, Sylvain
core +2 more sources
Efficient CSL Model Checking Using Stratification [PDF]
For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996.
Lijun Zhang+3 more
doaj +1 more source
Social networks have received considerable attention from the modal logic community. In this article, we study and characterize one of the most important principles in the field of social networks.
Xiling Luo
doaj +1 more source
occumb: An R package for site occupancy modeling of eDNA metabarcoding data
This study introduces a new R package, occumb, for the convenient application of site occupancy modeling using environmental DNA (eDNA) metabarcoding data. We outline a data analysis workflow, including data setup, model fitting, model assessment, and comparison of potential study settings based on model predictions, all of which can be performed using
Keiichi Fukaya, Yuta Hasebe
wiley +1 more source
Model Checking CTL is Almost Always Inherently Sequential [PDF]
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already ...
A. L. Selman+20 more
core +5 more sources
To explore the impact of the overexpression of the multidrug‐transporter P‐glycoprotein (ABCB1) on membrane fluidity, we compared the transversal gradient of mobility and microviscosity in plasma membranes of drug‐sensitive Chinese hamster ovary cells (AuxB1) and their multidrug‐resistant derivatives (B30) using the fluorescent n‐(9‐anthroyloxy) fatty ...
Roger Busche+2 more
wiley +1 more source
Tuberculosis remains a global health challenge and new therapeutic targets are required. Here, we characterized SseA, a sulfurtransferase from Mycobacterium tuberculosis involved in macrophage infection, and its interaction with the newly identified protein SufEMtb that activates SseA enzymatic activity.
Giulia Di Napoli+10 more
wiley +1 more source
Variability Abstraction and Refinement for Game-Based Lifted Model Checking of Full CTL [PDF]
One of the most promising approaches to fighting the configuration space explosion problem in lifted model checking are variability abstractions. In this work, we define a novel game-based approach for variability-specific abstraction and refinement for ...
A Campetelli+20 more
core +1 more source