Results 31 to 40 of about 133,374 (215)
Reasoning about Intuitionistic Computation Tree Logic
Electronic Proceedings in Theoretical Computer Science, 2023 In this paper, we define an intuitionistic version of Computation Tree Logic. After explaining the semantic features of intuitionistic logic, we examine how these characteristics can be interesting for formal verification purposes. Subsequently, we define the syntax and semantics of our intuitionistic version of CTL and study some simple properties of ...
Catta D., Malvone V., Murano A.
openaire +3 more sources
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
Probabilistic modal {\mu}-calculus with independent product [PDF]
Logical Methods in Computer Science, 2012 The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the ...
Matteo Mio
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
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
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
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.
Sriram Sankaranarayanan +3 more
openaire +3 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
An axiomatization of full Computation Tree Logic [PDF]
Journal of Symbolic Logic, 2001 AbstractWe give a sound and complete axiomatization for the full computation tree logic. CTL*, of R-generable models. This solves a long standing open problem in branching time temporal logic.
openaire +2 more sources
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