Search results for "Reachability"
showing 7 items of 17 documents
Intention to use mobile customer relationship management systems
2014
Purpose – The purpose of this paper is to investigate the behavioral intentions of business-to-business (B2B) sales managers to use mobile customer relationship management (CRM) systems in the course of their day-to-day activities. Design/methodology/approach – An extended Technology Acceptance Model (TAM) of mobile CRM system adoption is developed and tested with data from 105 international sales managers representing five B2B companies. Findings – The study extends the TAM framework with three additional constructs derived from mobile technology and sales force automation literature, namely personal innovativeness in the domain of IT, perceived risk, and perceived reachability. The model…
Feasibility of finite and infinite paths in data dependent programs
2005
This paper considers the feasibility of finite and infinite paths in programs in two simple programming languages. The language LBASE allows to express the dependencies of real time systems on integer data, the language LTIM can model quantitative timing constraints in r.t.s. specifications. It is proven that the problem of whether a given LBASE or LTIM program has an infinite feasible path (i.e. whether it can exhibit an infinite behaviour) is decidable. The possibilities to characterise the sets of all feasible finite and infinite paths in LBASE and LTIM programs are also discussed. The infinite feasible path existence problem is proven decidable also for the language LTIBA which has both…
Verification of scope-dependent hierarchical state machines
2008
AbstractA hierarchical state machine (Hsm) is a finite state machine where a vertex can either expand to another hierarchical state machine (box) or be a basic vertex (node). Each node is labeled with atomic propositions. We study an extension of such model which allows atomic propositions to label also boxes (Shsm). We show that Shsms can be exponentially more succinct than Shsms and verification is in general harder by an exponential factor. We carefully establish the computational complexity of reachability, cycle detection, and model checking against general Ltl and Ctl specifications. We also discuss some natural and interesting restrictions of the considered problems for which we can …
A sliding mode approach to H∞ non-fragile observer-based control design for uncertain Markovian neutral-type stochastic systems
2015
This paper is focused on designing an H ∞ sliding-mode control for a class of neutral-type stochastic systems with Markovian switching parameters and nonlinear uncertainties. An H ∞ non-fragile observer subjected to the transition rates of the switching mode is firstly constructed. By some specified matrices, the connections among the designed sliding surfaces corresponding to every mode are established. Then, the state-estimation-based sliding mode control law is designed to guarantee the reachability of the sliding surface in finite time interval. Furthermore, a stochastic stability criterion is established for all admissible uncertainties, which can guarantee the error system and sliding…
H∞ sliding mode control for uncertain neutral-type stochastic systems with Markovian jumping parameters
2015
This paper is devoted to the investigation of H ∞ sliding mode control (SMC) for uncertain neutral stochastic systems with Markovian jumping parameters and time-varying delays. A sliding surface functional is firstly constructed. Then, the sliding mode control law is designed to guarantee the reachability of the sliding surface in a finite-time interval. The sufficient conditions for asymptotically stochastic stability of sliding mode dynamics with a given disturbance attenuation level are presented in terms of linear matrix inequalities (LMIs). Finally, an example is provided to illustrate the efficiency of the proposed method.
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
2000
AbstractOver the past few years increasing research effort has been directed towards the automatic verification of infinite-state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achieving decidability. We present decidability results for a class of systems (called well-structured systems) which consist of a finite control part operating on an infinite data domain. The results assume that the data domain is equipped with a preorder which is a well quasi-ordering, such that the transition relation is “monotonic” (a simulation) with respect to the preorder. We show that the following properties are decidable for wel…
Environmental mitigation hierarchy and biodiversity offsets revisited through habitat connectivity modelling.
2020
International audience; Biodiversity loss is accelerating because of unceasing human activity and land clearing for development projects (urbanisation, transport infrastructure, mining and quarrying …). Environmental policy-makers and managers in different countries worldwide have proposed the mitigation hierarchy to ensure the goal of “no net loss (NNL) of biodiversity” and have included this principle in environmental impact assessment processes. However, spatial configuration is hardly ever taken into account in the mitigation hierarchy even though it would greatly benefit from recent developments in habitat connectivity modelling incorporating landscape graphs. Meanwhile, national, Euro…