Sciweavers

1032 search results - page 2 / 207
» Extended Computation Tree Logic
Sort
View
CSL
2010
Springer
15 years 3 months ago
Graded Computation Tree Logic with Binary Coding
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
Alessandro Bianco, Fabio Mogavero, Aniello Murano
IJIS
2011
83views more  IJIS 2011»
14 years 5 months ago
Conceptual modeling in full computation-tree logic with sequence modal operator
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
Ken Kaneiwa, Norihiro Kamide
127
Voted
TCS
2010
15 years 7 days ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
HASE
1998
IEEE
15 years 6 months ago
Combining Various Solution Techniques for Dynamic Fault Tree Analysis of Computer Systems
Fault trees provide a graphical and logical framework for analyzing the reliability of systems. A fault tree provides a conceptually simple modeling framework to represent the sys...
Ragavan Manian, Joanne Bechta Dugan, David Coppit,...
DLT
2008
15 years 3 months ago
Extended Multi Bottom-Up Tree Transducers
Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of ...
Joost Engelfriet, Eric Lilin, Andreas Maletti