Results 41 to 50 of about 138,161 (315)
Research on Privacy Protection in Social Network Based on Stochastic Model Checking [PDF]
Jisuanji gongcheng, 2021 The privacy settings in static privacy strategies of the existing online social networks are not flexible and hard for quantitative verification.To address the problem,this paper proposes a dynamic privacy protection framework,which models social ...
LIU Yang, GAO Shiguo
doaj +1 more source
Bounded saturation-based CTL model checking; pp. 59–70 [PDF]
Proceedings of the Estonian Academy of Sciences, 2013 Formal verification is becoming a fundamental step of safety-critical and model-based software development. As part of the verification process, model checking is one of the current advanced techniques to analyse the behaviour of a system. Symbolic model
András Vörös +2 more
doaj +1 more source
Formal Verification of Analog and Mixed Signal Circuit [PDF]
Jisuanji gongcheng, 2016 For the low fidelity and nonnormative description of formal modeling in Analog and Mixed Signal(AMS) circuit,a formal modeling method is proposed based on nodal analysis of Kirchhoff’s Current Law(KCL).An extension to Computation Tree Logic(CTL) formula
YANG Shihan,WU Jinzhao,DING Guanghong,QIN Donghong
doaj +1 more source
Nuclear Engineering and Technology, 2018 Calculating minimal cut sets is a typical quantification method used to evaluate the top event probability for a fault tree. If minimal cut sets cannot be calculated or if the accuracy of the quantification result is in doubt, the Monte Carlo method can ...
Sang Hoon Han
doaj +1 more source
Probabilistic regular graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph ...
Christophe Morvan, Nathalie Bertrand
doaj +1 more source
Deciding Full Branching Time Logic by Program Transformation [PDF]
, 2010 We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL*) properties of finite state reactive systems. The finite state systems and the CTL* properties we want to verify, are encoded as logic programs on ...
E.A. Emerson +12 more
core +3 more sources
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories [PDF]
Logical Methods in Computer Science, 2013 We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007).
Luis Barguñó +4 more
doaj +1 more source
Min-max Computation Tree Logic
Artificial Intelligence, 2001 This paper introduces a branching time temporal query language called Min-max CTL which is similar in syntax to the popular temporal logic, CTL [\textit{E. M. Clarke, E. A. Emerson} and \textit{A. P. Sistla}, ACM Trans. Program. Lang. Systems 8, 244-263 (1986; Zbl 0591.68027)]. However unlike CTL, Min-max CTL can express timing queries on a timed model.
Dasgupta, Pallab +3 more
openaire +2 more sources
IEEE Access, 2020 The improved productivity and reduced time-to-market are essential requirements for the development of modern embedded systems and, therefore, the comprehensive as well as timely design verification is critical.
Muhammad Waseem Anwar +5 more
doaj +1 more source
Towards Algorithmic Synthesis of Synchronization for Shared-Memory Concurrent Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We present a framework that takes a concurrent program composed of unsynchronized processes, along with a temporal specification of their global concurrent behaviour, and automatically generates a concurrent program with synchronization ensuring correct ...
Roopsha Samanta
doaj +1 more source