Search results for "Reachability"
showing 10 items of 17 documents
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…
General decidability theorems for infinite-state systems
2002
Over the last few years there has been an increasing research effort 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 well-ordered and well-founded preorder such that the transition relation is "monotonic" (is a simulation) with respect to the preorder. We show that the following properties are decidable for …
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…
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…
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…
Optimal paths in weighted timed automata
2004
AbstractWe consider the optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to computing (parametric) shortest paths in a finite weighted directed graph. We call this graph a parametric sub-region graph. It refines the region graph, a standard tool for the analysis of timed automata, by adding the information which is relevant to solving the optimal-reachability problem. We present an algorithm to solve the optimal-reachability problem for weighted timed automata that takes time exponential in O(n(|δ(A)|+|wmax|)), where n is the number of clock…
A study of mobility and reachability in ad hoc networks using stochastic activity networks
2006
The integration of ad-hoc networks into real environments is now becoming more and more common and supervision and control systems are no exception. The efficiency of the communication in these networks as well as various other factors, are governed by the working area, the number of nodes, mobility, transmission power, etc. In this paper, the mobility and reachability of mobile nodes appearing spontaneously in a large installation such as can be found in a water purification system are studied. These nodes form an ad-hoc network and communicate between each other in order to finally reach a fixed node which can offer them information from the rest of the system in real time or act as a gat…
Relative Reachability Analysis as a Tool for Urban Mobility Planning
2019
There is a plethora of user-oriented route planning applications and systems that enable the computation of the fastest journey between two locations using different transportation modes, e.g., car, public transport, walking, bicycle. While useful for individuals, they are of limited interest to a class of users that may be interested in a more global and comparative view of transportation systems in general. In this context, we adopt the view of an urban planner. Urban planners may be interested in queries such as "if a new transit stop was to be introduced in a given location, would that bring the travel time to a given point-of-interest (POI) or area-of-interest (AOI) by bus closer to th…
Robust control of stochastic systems against bounded disturbances with application to flight control
2014
This paper investigates the problems of state observer design and observer-based integral sliding-mode control (SMC) for a class of Itô stochastic systems subject to simultaneous input and output disturbances. A new type of sliding-mode-based descriptor observer method is developed to approximate the system state and disturbance vectors. An integral-type SMC scheme is proposed based on the state estimation to stabilize the overall system. The main contributions of this approach are as follows: 1) The desired estimations of state and disturbance vectors can be obtained simultaneously, and 2) in the designed sliding-mode observer, the integral term of the Itô stochastic noise is eliminated …
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…