• No results found

[PDF] Top 20 Abstraction In Model Checking Real-Time Temporal Logic of Knowledge

Has 10000 "Abstraction In Model Checking Real-Time Temporal Logic of Knowledge" found on our website. Below are the top 20 most common "Abstraction In Model Checking Real-Time Temporal Logic of Knowledge".

Abstraction In Model Checking Real-Time Temporal Logic of Knowledge

Abstraction In Model Checking Real-Time Temporal Logic of Knowledge

... of real time systems, and the railroad crossing system presented here is a variant of ...a time point between 200 and 300 seconds after its sending the approach signal, Train sends a in signal to its ... See full document

9

An efficient coronary heart disease prediction by semi parametric 
		Extended Dynamic Bayesian Network with optimized cut points

An efficient coronary heart disease prediction by semi parametric Extended Dynamic Bayesian Network with optimized cut points

... in time and it ’ s used to represent the complex stochastic processes to study their properties or make predictions based on the future ...of temporal abstractions from data is used for building DBN ... See full document

6

FLEXIBLE SHARING IN DHT BASED P2P NETWORKS USING METADATA OF RESOURCE

FLEXIBLE SHARING IN DHT BASED P2P NETWORKS USING METADATA OF RESOURCE

... In model checking temporal logic, abstraction and abstraction refinement techniques have been studied[7,9], and in real time systems, the construction of abstract ... See full document

11

Finite Abstractions for the Verification of Epistemic Properties in Open Multi-Agent Systems

Finite Abstractions for the Verification of Epistemic Properties in Open Multi-Agent Systems

... Case: Knowledge in open MAS networks We now illustrate the formalism introduced by means of an example on agent ...diffusion model (see [?, ...purely temporal specifications. In the SIR model ... See full document

7

The complexity of counting models of linear-time temporal logic

The complexity of counting models of linear-time temporal logic

... then model checking ...a model checking algorithm on them. In particular, the running time of the algorithms is exponential (or worse) in the bound k, which is in stark contrast to the ... See full document

12

Deductive temporal reasoning with constraints

Deductive temporal reasoning with constraints

... in time. In this paper we consider a logic which is a combination of standard propositional linear time temporal logic with cardinality constraints restricting the numbers of literals ... See full document

27

Formal Property Verification of Counter FSM and I2C

Formal Property Verification of Counter FSM and I2C

... equivalence checking and model ...equivalence checking, model checking is more effective in real time projects ...the temporal logic, writing the CTL ... See full document

6

Probabilistic Model Checking on Propositional Projection Temporal Logic

Probabilistic Model Checking on Propositional Projection Temporal Logic

... Traditional model checking techniques focus on a sys- tematic check of the validity of a temporal logic formula on a precise mathematical ...the model checking question is either ... See full document

7

Combined model checking for temporal, probabilistic, and real-time logics

Combined model checking for temporal, probabilistic, and real-time logics

... we model the behaviour of the message forwarding component of the ...simplified model of the message forwarding component is given in ...to model this probabilistic behaviour, we adapt the ... See full document

28

Efficient Parametric Model Checking Using Domain Knowledge

Efficient Parametric Model Checking Using Domain Knowledge

... As shown in Fig. 1, ePMC comprises two stages. The first stage is performed only once for each domain that ePMC is applied to. This stage uses domain-expert input to identify modelling patterns for components of systems ... See full document

21

A Resolution Calculus for the Branching-Time Temporal Logic CTL

A Resolution Calculus for the Branching-Time Temporal Logic CTL

... More details about CTL-RP are given in [Zhang et al. 2009b; Zhang 2010] along with an experimental comparison with a tableau prover for CTL (namely the CTL module for the Tableau Workbench) [Abate and Gor´e 2003]. We ... See full document

51

Satisfiability in Strategy Logic Can Be Easier than Model Checking

Satisfiability in Strategy Logic Can Be Easier than Model Checking

... than model-checking, witness an already rare ...between model- checking and satisfiability is not only interesting from a theo- retical perspective, but it may also carry important practical ... See full document

8

A branching-time theory for probabilistic model-checking

A branching-time theory for probabilistic model-checking

... NPLTSs were rst introduced by Hansson [Han94] as a general model of probabilistic computation. Other state-machine-oriented models of probabilistic computation have natural encodings as NPTLSs, and we briey review ... See full document

14

Reducing the cost of real-time software through a cyclic task abstraction for Ada

Reducing the cost of real-time software through a cyclic task abstraction for Ada

... tasking model into core and real-time components, together with implementing cyclic tasks within Ada’s existing task type, addresses the existing community the aversion to implementing high-level ... See full document

211

Converting from Service Level Agreement to Probabilistic Temporal Logic Specification

Converting from Service Level Agreement to Probabilistic Temporal Logic Specification

... as model checking tools have been developed and used by others, such as PRISM ...a model checker is not a straight forward activity due to different language ...migration model and SLA ... See full document

7

On the boundary of (un)decidability: decidable model checking for a fragment of resource agent logic

On the boundary of (un)decidability: decidable model checking for a fragment of resource agent logic

... The paper is organised as follows. In Section 2 we intro- duce our version of resource agent logic, its models and the semantics. Afterwards, we put our setting in context with existing work, discussing the main ... See full document

8

A neural-symbolic system for temporal reasoning with application to model verification and learning

A neural-symbolic system for temporal reasoning with application to model verification and learning

... through time. In our concept chosen connectionist architecture, each time point is defined as the application of a di ff erent input vector to the network, and all the computation runs until the output ... See full document

191

A Neural-Symbolic Cognitive Agent for Online Learning and Reasoning

A Neural-Symbolic Cognitive Agent for Online Learning and Reasoning

... of logic- based (symbolic) systems and are therefore difficult to un- derstand and validate [Smith and Kosslyn, ...to logic-based systems [Heuvelink, ...internal knowledge as they are logic ... See full document

7

Aternating time temporal logic with resource bounds

Aternating time temporal logic with resource bounds

... a model-checking algorithm for RB-ATL which runs in time polynomial in the size of the formula (if resource bounds are encoded in unary) and the structure, and is exponential in the number of ...the ... See full document

33

Alternating time temporal logic with resource bounds

Alternating time temporal logic with resource bounds

... of temporal logics and logics of coalitional ability which are capable of expressing resource bounds have been proposed in the literature, for example, [7, 8, 10, 11, ...the model-checking problem, ... See full document

43

Show all 10000 documents...