Results 41 to 50 of about 23,407,383 (367)

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

Automated Rule Checking for MEP Systems Based on BIM and KBMS

Buildings, 2022
Due to the growing complexity of mechanical, electrical, and plumbing (MEP) designs and the rules that govern them, performing rule checks manually has become expensive.
Xuanfeng Xie, Jianliang Zhou, Xuehai Fu, Ruoyi Zhang, Hui Zhu, Quanxi Bao   +5 more
doaj   +1 more source

Fluid Model Checking of Timed Properties [PDF]

, 2015
We address the problem of verifying timed properties of Markovian models of large populations of interacting agents, modelled as finite state automata.
Bortolussi, Luca, Lanciani, Roberta
core   +2 more sources

Towards Light-Weight Probabilistic Model Checking

Journal of Applied Mathematics, 2014
Model checking has been extensively used to verify various systems. However, this usually has been done by experts who have a good understanding of model checking and who are familiar with the syntax of both modelling and property specification languages.
Savas Konur
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, Kim G. Larsen, Nicolas Markey   +2 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, Meier, Arne, Mundhenk, Martin, Schneiden, Thomas, Schneider, Thomas, Thomas, Michael, Vollmer, Heribert   +6 more
core   +4 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, David N. Jansen, Flemming Nielson, Holger Hermanns   +3 more
doaj   +1 more source

Model Checking CTL is Almost Always Inherently Sequential [PDF]

, 2011
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, A. Meier, M. Mundhenk, M. Thomas, and H., A. Sistla and E. Clarke, Arne Meier, E. A. Emerson and C.-L. Lei, E. A. Emerson and E. M. Clarke, E. A. Emerson and J. Y. Halpern, E. A. Emerson and J. Y. Halpern, E. Clarke, E. A. Emerson, and A. Sistla, F. Laroussinie, H. Schnoor, Heribert Vollmer, K. Regan and H. Vollmer, Martin Mundhenk, Michael Thomas, N. Markey, Neil Immerman, O. Kupferman, M. Y. Vardi, and P. Wolper, Olaf Beyersdorff, Thomas Schneider, W. L. Ruzzo   +20 more
core   +5 more sources

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, Conrad Boton, Pierre Blanchet   +2 more
doaj   +1 more source

Model Checking Parse Trees

, 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