Results 41 to 50 of about 21,783,491 (356)
Model-Checking of Smart Contracts
2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), 2018 DAO attack showed that formal verification of smart contracts is an important issue that should be addressed to prevent irreversible consequences due to design faults activation in Blockchain applications.
Zeinab Nehai +2 more
semanticscholar +1 more source
Model Checking in Bits and Pieces [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 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
LTL Model Checking Based on Binary Classification of Machine Learning
IEEE Access, 2019 Linear Temporal Logic (LTL) Model Checking (MC) has been applied to many fields. However, the state explosion problem and the exponentially computational complexity restrict the further applications of LTL model checking.
Weijun Zhu, Huanmei Wu, Miaolei Deng
doaj +1 more source
Model Checking One-clock Priced Timed Automata [PDF]
Logical Methods in Computer Science, 2008 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
BIM-Based Checking Method for the Mass Timber Industry
Buildings, 2023 Since the 1990s, mass timber constructions have become more and more popular. This type of construction has characteristics that are ideal for incorporating building information modeling (BIM).
Chloé Paskoff +2 more
doaj +1 more source
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 Usage Policies [PDF]
Mathematical Structures in Computer Science, 2009 We study usage automata, a formal model for specifying policies on the usage of resources. Usage automata extend finite state automata with some additional features, parameters and guards, that improve their expressivity. We show that usage automata are expressive enough to model policies of real-world applications.
BARTOLETTI, MASSIMO +3 more
openaire +8 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
Heliyon, 2023 Problem: The congenial of the imputation model is crucial for valid statistical inferences. Hence, it is important to develop methodologies for diagnosing imputation models.
Mingyang Cai +2 more
doaj +1 more source