A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Model Checking Semi-Continuous Time Models Using BDDs
2001
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
One possible use of model checking to analyze timed systems is by modeling passage of time as the number of taken transitions and applying quantitative algorithms to determine the timing parameters of ...
We then use these algorithms to introduce a new model of time, in which the passage of time is dissociated from the occurrence of events. ...
Acknowledgments We would like to thank Howard Wong-Toi for the many useful discussions about the examples that have been veri ed in HyTech. ...
doi:10.1016/s1571-0661(04)80670-4
fatcat:okqsrqgvsnfjro55oktktsjcvq
Memory Efficient Data Structures for Explicit Verification of Timed Systems
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Timed analysis of real-time systems can be performed using continuous (symbolic) or discrete (explicit) techniques. ...
In the setting of timed-arc Petri nets, we explore new data structures for lowering the used memory: PTries for efficient storing of configurations and time darts for semi-symbolic description of the statespace ...
We shall study possible solutions for saving memory in explicit model checking using BDDs [4] , time darts data structure [10] and a new data-structure PTrie. ...
doi:10.1007/978-3-319-06200-6_26
fatcat:wtei53psvjfqvkrremvglfqg3u
A Symbolic Model Checker for tccp Programs
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model-checking algorithm for reactive systems. ...
We show how the symbolic approach to model checking for tccp improves previous approaches based on the classical Linear Time Logic (LTL) model checking algorithm. ...
Symbolic Model Checking The idea of symbolic model checking is to represent the graph structure (the model) as a boolean formula, and then transform it into the efficient structure of BDD [5] . ...
doi:10.1007/11423331_5
fatcat:koere7d62zbchblctnsj76pixu
Development and Validation of a Measure for Metacognitive Factors in Body Dysmorphic Disorder Patients
2015
International journal of clinical medicine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Conclusions: The scales may prompt future research into BDD and facilitate clinical assessment and case formulation. ...
Convergent validity of Body Dysmorphic Metacognitive Scale (BDMCS) with Yale-Brown Obsessive Compulsive Scale was modified for Body Dysmorphic Disorder (BDD) and Thought Fusion Instrument (r = 0.44, r ...
{This sentence is vague: Most of time, when I use energy it is a mental energy (rather than other types of energy) OR I use metal energy for my appearance most of my time in a day} 5) Most of time I focus ...
doi:10.4236/ijcm.2015.65043
fatcat:q2gdgg3wqvbkbgeoss4zbfda7m
Difference Decision Diagrams
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
DDDs enable an efficient verification of timed systems modeled as, for example, timed automata or timed Petri nets, since both the states and their associated timing information are represented symbolically ...
, similar to how BDDs represent Boolean predicates. ...
Another approach [25] suggests using a partition refinement algorithm for efficient model checking. However, the reported running times are still exponential. ...
doi:10.1007/3-540-48168-0_9
fatcat:6a5jnkz22rc5fixkwfdlf6sy6i
Benefits of Bounded Model Checking at an Industrial Setting
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In Forecast, we present several alternatives for adapting BDD-based model checking for BMC. ...
The usefulness of Bounded Model Checking (BMC) based on propositional satisfiability (SAT) methods for bug hunting has already been proven in several recent work. ...
) for bounded model checking and a thorough and fair evaluation of bounded model checking on SAT versus BDD based model checking making use of a rich set of real-life complex verification and falsification ...
doi:10.1007/3-540-44585-4_43
fatcat:bhdmgblwgrbmppnegl5cckvqxu
Semi-formal Bounded Model Checking
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
More importantly, our verification approach continuously knows its coverage of the search space, providing useful semi-formal verification results when full verification is infeasible. ...
This paper presents a novel approach to bounded model checking. We replace the SAT solver by an extended simulator of the circuit being verified. ...
More importantly, our bounded model-checking engine continuously maintains a conservative bound on the fraction of the search space that has been verified, allowing our method to be used in a semi-formal ...
doi:10.1007/3-540-45657-0_21
fatcat:zwk3drgtcrhj5jpsaylvssl5vy
TRANSYT:A Tool for the Verification of Asynchronous Concurrent Systems
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The user can activate all phases of the verification process (file parsing, system construction, reachability analysis, model checking, simulation, counter-example generation, etc.) with full control of ...
Model Checking. transyt implements fair CTL model checking as defined in [6] , and also offers specialized on-the-fly invariant verification. ...
Invariant verification for both timed and untimed systems is fully supported, while CTL model checking is currently supported for untimed systems. transyt provides orders of magnitude improvement over ...
doi:10.1007/11513988_42
fatcat:c3ai4pjn55dbzcocy6r63of4nm
SMART: the stochastic model checking analyzer for reliability and timing
2004
First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
S M A R T provides a seamless environment for the logic and probabilistic analysis of complex systems, for use in both the classroom and industrial applications. ...
In addition, certain classes of non-Markov models can be solved numerically. For more details, see G. Ciardo et. al., "Logical and stochastic modeling with SMART", in Proc. ...
All model-checking algorithms in S M A R T use symbolic techniques. ...
doi:10.1109/qest.2004.1348056
dblp:conf/qest/CiardoM04
fatcat:2vhi7qag7bemnojgak6yzma73m
POSE
1996
Proceedings of the 33rd annual conference on Design automation conference - DAC '96
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
POSE provides a unified framework for specifying and maintaining power relevant circuit information and means of estimating power consumption of a circuit using different load models. ...
Using Semi-local BDDs Local BDD for a node n is defined as a BDD where immediate fanins of node n are used in building the BDD. ...
The semi-local BDD for a node n is defined as the BDD where the nodes used as the BDD variables create a cut in the transitive fanin cone of n. ...
doi:10.1145/240518.240522
dblp:conf/dac/ImanP96
fatcat:46bxo67qnzh67isqta7adl57hi
Body Image and Meta-Worry as Mediators of Body Dysmorphic Disorder
2015
International journal of clinical medicine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Results: The data supported the model, and meta-worry and body image significantly mediated the relationship between cognitive, metacognitive beliefs and BDD. ...
Conclusion: The model may prompt future research into body dysmorphic disorder. ...
For these analyses the Structural Equation Modeling program AMOS 5 was used [19] . ...
doi:10.4236/ijcm.2015.63022
fatcat:ylezbzrw6fhdzk74y72viwdwry
Transforming Truth Tables to Binary Decision Diagrams Using the Role-based Synchronization Approach
2019
International Conference on Software Technologies: Applications and Foundations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements This work has been funded by the German Research Foundation within the Research Training Group "Role-based Software Infrastructures for continuous-context-sensitive Systems" (GRK 1907) ...
Furthermore, the BDT approaches take longer to be created than the BDD ones which is due to the continuous allocation of new leaf nodes. ...
08 Output: 2 Model instance Unordered RSync BDD RSync BDT 0.0 0.2 0.4 0.6 0.8 1.0 Decision nodes (normalized) Input: 08 Output: 4 Input: 10 Output: 2 (a) Total time. ...
dblp:conf/staf/WernerBMSA19
fatcat:qihgwgfofra25enjm6o2s64fmq
Interval-based Counterexample Analysis for Error Explanation
2021
Journal of Information Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We present a method for computing the longest interval by combining bounded model checking, BDD, and AllSAT solver. ...
Model checking is an automated reasoning technique for the verification of hardware and software. ...
Model checking is a method for checking the behavior of systems whose states change over time in a non-deterministic manner [6] , [7] . ...
doi:10.2197/ipsjjip.29.630
fatcat:w2re6blj7vekro4hzazh5yezmm
Guaranteeing Termination of Fully Symbolic Timed Forward Model Checking
2012
2012 13th International Workshop on Microprocessor Test and Verification (MTV)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a normalization technique to guarantee termination of fully symbolic forward model checking for timed automata. ...
Whereas for semi-symbolic model checkers based on convex clock zones there exist methods in the literature to solve this problem, our normalization algorithm can be applied to fully symbolic model checkers ...
In contrast to the algorithms for semi-symbolic model checking, where convex clock zones are enlarged, our normalization algorithm uses operation (3) mentioned above. ...
doi:10.1109/mtv.2012.22
dblp:conf/mtv/MorbeS12
fatcat:j4m6nclkxbgcbe3oh75ds7jjlu
A survey of recent advances in SAT-based formal verification
2005
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
This paper presents a survey of the latest developments in SAT-based formal verification, including incomplete methods such as bounded model checking, and complete methods for model checking. ...
BDD-based symbolic model checking continues to be the de-facto standard for verifying properties. ...
Applications of infinite model checking are real-time systems, modeled as timed automata [3] , or even system software [8] . ...
doi:10.1007/s10009-004-0183-4
fatcat:d6hub3n6uzezhkl7dnneh2glgu
« Previous
Showing results 1 — 15 out of 1,181 results