Results 291 to 300 of about 138,161 (315)

Analysing scientific workflows with Computational Tree Logic

Cluster Computing, 2009
Motivated by the widespread use of workflow systems in e-Science applications, this article introduces a formal analysis framework for the verification and profiling of the control flow aspects of scientific workflows. The framework relies on process algebras that characterise each workflow component with a process behaviour, which is then used to ...
Curcin, Vasa, Ghanem, Moustafa M., Guo, Yike   +2 more
openaire   +2 more sources

A Visual Formalism for Computational Tree Logic

Journal of Visual Languages & Computing, 1999
The recent advances in computer graphics and multimedia technology provide new means for the visualization of abstract information spaces through the use of multi-dimensional and multi-modal communication channels. In the context of computer-aided verification, this potential can be effectively employed to provide visual notations for mathematical ...
A. DEL BIMBO, E. VICARIO
openaire   +1 more source

Polytime model checking for timed probabilistic computation tree logic

Acta Informatica, 1998
We consider the model checking problem for timed probabilistic computation tree logic (TPCTL) introduced by H. A. Hansson and D. Jonsson, and studied in a recent book by \textit{H. A. Hansson} ``Time and probability in formal design of distributed systems'' (Elsevier, 1994). The semantics of TPCTL is defined in terms of probabilistic transition systems.
Beauquier, Danièle, Slissenko, Anatol
openaire   +2 more sources

Temporal Logics with Reference Pointers and Computation Tree Logics

Journal of Applied Non-Classical Logics, 2000
ABSTRACT A complete axiomatic system CTLrp is introduced for a temporal logic for finitely branching ω+ -trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTLrp.
openaire   +1 more source

Graded Computation Tree Logic with Binary Coding

2010
Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the branching-time temporal logic CTL (GCTL), in such a way that they can express statements about a minimal and conservative number of accessible paths.
BIANCO, ALESSANDRO, MOGAVERO, FABIO, MURANO, ANIELLO   +2 more
openaire   +2 more sources

Fuzzy logic system for fuzzy event tree computing

Proceedings First International IEEE Symposium Intelligent Systems, 2003
The paper presents the authors' contribution in developing a fuzzy logic system for event-tree analysis. The fuzzy event-tree method can be used for the protection and automation of power systems independent safety analysis. The main contribution of the proposed analysis is the evaluation or the general fuzzy conclusion named "general safety ...
M. Dumitrescu, A.P. Ulmeanu, T. Munteanu
openaire   +1 more source

Gastroenteropancreatic Neuroendocrine Tumors

Ca-A Cancer Journal for Clinicians, 2018
Mauro Cives
exaly  

Magnetic skyrmions: advances in physics and potential applications

Nature Reviews Materials, 2017
Albert Fert, Nicolas Reyren, Vincent Cros   +2 more
exaly  

Organic electrochemical transistors

Nature Reviews Materials, 2018
Jonathan Rivnay, Sahika inal, Alberto Salleo   +2 more
exaly  

Mastering the game of Go with deep neural networks and tree search

Nature, 2016
David Silver, Aja Huang, Arthur Guez
exaly