Results 41 to 50 of about 1,197,029 (323)
, 2013 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
Counterexample Generation in Probabilistic Model Checking [PDF]
, 2009 Providing evidence for the refutation of a property is an essential, if not the most important, feature of model checking. This paper considers algorithms for counterexample generation for probabilistic CTL formulae in discrete-time Markov chains ...
Damman, B., Han, T., Katoen, J.P.
core +5 more sources
Efficient CSL Model Checking Using Stratification [PDF]
Logical Methods in Computer Science, 2012 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
Model Checking CTL is Almost Always Inherently Sequential [PDF]
, 2009 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 ...
Beyersdorff, Olaf +6 more
core +4 more sources
Real-Time Model-Checking: Parameters everywhere [PDF]
Logical Methods in Computer Science, 2007 In this paper, we study the model-checking and parameter synthesis problems of the logic TCTL over discrete-timed automata where parameters are allowed both in the model (timed automaton) and in the property (temporal formula). Our results are as follows.
Veronique Bruyere, Jean-Francois Raskin
doaj +1 more source
Mathematics, 2023 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
Variability Abstraction and Refinement for Game-Based Lifted Model Checking of Full CTL [PDF]
, 2019 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
Model Checking Based Approach for Compliance Checking
Information Technology and Control, 2019 Process mining is the set of techniques to retrieve a process model starting from available logging data. The discovered process model has to be analyzed to verify it respects the defined properties, i.e., the so-called compliance checking. Our aim is to use a model checking based approach to verify compliance.
Martinelli F. +5 more
openaire +5 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Children undergoing allogeneic stem cell transplantation often receive off‐label rituximab treatment for Epstein–Barr virus reactivation, using adult dosing without pediatric evidence. This project aims to develop a clinical decision support tool (CDSS) that provides evidence‐based dosing scenarios by analyzing real‐world patient data.
Birgit Burkhardt +2 more
wiley +1 more source
Counterexample-Preserving Reduction for Symbolic Model Checking
Journal of Applied Mathematics, 2014 The cost of LTL model checking is highly sensitive to the length of the formula under verification. We observe that, under some specific conditions, the input LTL formula can be reduced to an easier-to-handle one before model checking. In such reduction,
Wanwei Liu +5 more
doaj +1 more source