Results 61 to 70 of about 133,374 (215)

Vectorized model checking for computation tree logic [PDF]

open access: yes, 1991
The aim of this paper is to show how big model checking problems for Computation Tree Logic (CTL) can be handled by using current powerful vector processors. Although efficient recursive model checking algorithms for CTL, which run in time proportional to both the size of Kripke structures and the length of formulas, have been already proposed [7, 2 ...
Shintaro Meki   +2 more
openaire   +2 more sources

Verifying the Smart Contracts of the Port Supply Chain System Based on Probabilistic Model Checking

open access: yesSystems, 2022
Port supply chains play a very important role in the process of economic globalization. Lack of trust of the mechanism is the main factor in restricting the development of port supply chains.
Yang Liu   +3 more
doaj   +1 more source

Open Answer Set Programming with Guarded Programs

open access: yes, 2007
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program's constants.
Clark K. L.   +13 more
core   +2 more sources

Reducing Calculation Times for Seismic Hazard Using Non-Ergodic Ground-Motion Models for Areal Source Zones

open access: yesApplied Sciences
Using non-ergodic ground-motion models (GMMs) in probabilistic seismic hazard analysis (PSHA) for areal sources can lead to large increases in calculation time compared to PSHA based on ergodic GMMs due to the large number of branches on the logic tree ...
Maxime Lacour, Norman Abrahamson
doaj   +1 more source

Functional safety verification of train control procedure in train-centric CBTC by colored petri net [PDF]

open access: yesArchives of Transport, 2020
Communication-based Train Control (CBTC) system is a widely-used signaling system. There is an increasing demand for innovating the traditional ground-centric architecture.
Junting Lin, Qian Xu
doaj   +1 more source

A Counting Logic for Structure Transition Systems [PDF]

open access: yes, 2012
Quantitative questions such as "what is the maximum number of tokens in a place of a Petri net?" or "what is the maximal reachable height of the stack of a pushdown automaton?" play a significant role in understanding models of computation. To study such
Kaiser, Lukasz
core   +1 more source

A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages [PDF]

open access: yes, 2001
It is well known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of logic programs to be improved. In this paper, we present a novel combination
Bagnara, R., Hill, P.M., Zaffanella, E.
core   +10 more sources

A New Method for Verification and Evaluation of PLC Software

open access: yesJournal of Innovative Science and Engineering, 2023
Varying market demands and changes in production standards require production systems to be effortlessly modifiable and quickly operational. On the other hand, designing, developing, and testing the control system of a new production system prove costly ...
Muhammed Ali Nur ÖZ   +1 more
doaj   +1 more source

Safety-Aware Apprenticeship Learning

open access: yes, 2018
Apprenticeship learning (AL) is a kind of Learning from Demonstration techniques where the reward function of a Markov Decision Process (MDP) is unknown to the learning agent and the agent has to derive a good policy by observing an expert's ...
A Solar-Lezama   +10 more
core   +1 more source

A Team Based Variant of CTL

open access: yes, 2015
We introduce two variants of computation tree logic CTL based on team semantics: an asynchronous one and a synchronous one. For both variants we investigate the computational complexity of the satisfiability as well as the model checking problem.
Krebs, Andreas   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy