6,876 Hits in 4.4 sec

Reachability solution characterization of parametric real-time systems

Farn Wang, Hsu-Chun Yen
2004 Theoretical Computer Science  
We investigate the problem of characterizing the solution spaces for timed automata augmented by unknown timing parameters (called timing parameter automata (TPA)).  ...  The main contribution of this paper is that we identify three non-trivial subclasses of TPAs, namely, upper-bound, lower-bound and bipartite TPAs, and analyze how hard it is to characterize the solution  ...  Acknowledgements The authors thank the anonymous referees for their comments and suggestions, which greatly improved the correctness as well as the presentation of this paper.  ... 
doi:10.1016/j.tcs.2004.07.014 fatcat:ub3hiw7dojbxzgeeywxsrsgwtm

Page 8865 of Mathematical Reviews Vol. , Issue 2003k [page]

2003 Mathematical Reviews  
The characterization and con- struction of local exponential observers for nonlinear systems with real parametric uncertainty are presented.  ...  The first paper is a study of the exponential observer design for discrete time nonlinear systems with parametric uncertainty.  ... 

Program Verification by Using DISCOVERER [chapter]

Lu Yang, Naijun Zhan, Bican Xia, Chaochen Zhou
2008 Lecture Notes in Computer Science  
programs, and reachability computation of hybrid systems etc.  ...  Based on the work of complete discrimination systems of polynomials [33,31], we invented new theories and algorithms [32, 30, 35] for SAS solving and partly implemented them as a real symbolic computation  ...  Acknowledgement The authors sincerely thank the anonymous referees for their useful comments which are helpful for improving the presentation of this paper.  ... 
doi:10.1007/978-3-540-69149-5_58 fatcat:6xf2gidq5rfczbncg3strt2qfi

Control Synthesis for Parametric Timed Automata under Reachability

2021 Turkish Journal of Electrical Engineering and Computer Sciences  
Timed automata is a fundamental modeling formalism for real-time systems. During the design of such real-time systems, often the system information is incomplete, and design choices can vary.  ...  The correctness and the completeness (under mild assumptions) of the developed algorithm are proven. The findings of the paper are illustrated on an example drawn from scheduling.  ...  Some of the examples of TA models of real-time systems are scheduling of real-time systems [2] [3] [4] , medical devices [5, 6] , and rail-road crossing systems [7] .  ... 
doi:10.3906/elk-2007-170 fatcat:cvswiposhraz5gcnvqsf5jg7fe

Parametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination

Lisa Hutschenreiter, Christel Baier, Joachim Klein
2017 Electronic Proceedings in Theoretical Computer Science  
Among the tasks typically addressed in the analysis of parametric Markov chains are (1) the computation of closed-form solutions for reachabilty probabilities and other quantitative measures and (2) finding  ...  Moreover, we identify fragments of PCTL and subclasses of parametric Markov chains where (1) and (3) are solvable in polynomial time and establish NP-hardness for other PCTL fragments.  ...  It is well-known that the probabilities p s for reachability conditions ♦Goal in parametric Markov chains with a finite state space S can be characterized as the unique solution of a linear equation system  ... 
doi:10.4204/eptcs.256.2 fatcat:sjnjfdlicjembfcymvrmn4hs5y

Reachability in Parametric Interval Markov Chains Using Constraints [chapter]

Anicet Bart, Benoît Delahaye, Didier Lime, Éric Monfroy, Charlotte Truchet
2017 Lecture Notes in Computer Science  
We then investigate solutions to several parameter synthesis problems in the context of pIMCs -consistency, qualitative reachability and quantitative reachability -that rely on constraint encodings.  ...  values: transitions in pIMCs are labeled with parametric intervals of probabilities.  ...  Once this partition is chosen, the reachability probabilities of all states in S ? are computed as the unique solution of a linear equation system (see [2] , Theorem 10.19, p.766).  ... 
doi:10.1007/978-3-319-66335-7_11 fatcat:4hxd6dscobewxmszkmg5mkrxpq

Model-based Predictive Control of Hybrid Systems: A Probabilistic Neural-network Approach to Real-time Control

Boštjan Potočnik, Gašper Mušič, Igor Škrjanc, Borut Zupančič
2007 Journal of Intelligent and Robotic Systems  
Existing solutions are based on dynamic programming and multi-parametric programming approaches, while the one proposed in this paper is based on a modified version of performance-driven reachability analyses  ...  The trained PNN is used as a system-state-based control-law classifier. Thus, the online computational effort is minimized and the control can be implemented in real time.  ...  be implemented in real time.  ... 
doi:10.1007/s10846-007-9180-7 fatcat:noevjywcynfunbrwjiabio2hu4

A benchmark library for parametric timed model checking [article]

2018 arXiv   pre-print
Verification of real-time systems involving hard timing constraints and concurrency is of utmost importance.  ...  Parametric timed model checking allows for formal verification in the presence of unknown timing constants or uncertainty (e.g. imprecision for periods).  ...  This is the case of Thales' FMTV 1 challenge 2014 where the system was characterized with uncertain but constant periods, that rules out the use of non-parametric timed model checking.  ... 
arXiv:1812.08441v1 fatcat:3ax2kb25hngf3mvye74ljuui7e

Page 7070 of Mathematical Reviews Vol. , Issue 2003i [page]

2003 Mathematical Reviews  
We present a method for deciding reachability properties of networks of timed processes.  ...  {For the entire collection see MR 2003d:00011.} 2003i:68094 68Q80 68Q45 Terrier, Véronique (F-CAEN-IGR; Caen) Characterization of real time iterative array by alternating device.  ... 

Page 7489 of Mathematical Reviews Vol. , Issue 90M [page]

1990 Mathematical Reviews  
Using this parametrization, the authors develop an algorithm which checks whether a set of prospective parameter values leads to a positive real V(-), obtaining thereby an algebraic characterization of  ...  The main result of the article is the solution of the realization problem for this class of nonlinear systems, in the spirit of the Ho-Kalman-Zeiger algorithm for linear systems.  ... 

Robust Multi-Parametric Control of Continuous-Time Linear Dynamic Systems

Muxin Sun, Mario E. Villanueva, Efstratios N. Pistikopoulos, Benoît Chachuat
2017 IFAC-PapersOnLine  
We extend a recent methodology called multi-parametric NCO-tracking for the design of parametric controllers for continuous-time linear dynamic systems in the presence of uncertainty.  ...  We address the case of additive uncertainty, and we discuss approaches to handling multiplicative uncertainty that retain tractability of the mp-NCO-tracking design problem, subject to extra conservatism  ...  Sun thanks the Department of Chemical Engineering and the Faculty of Engineering of Imperial College London for an EPSRC International Doctoral Training Award (DTA).  ... 
doi:10.1016/j.ifacol.2017.08.690 fatcat:66pbeg4e6vcn7cuentf47feifq

A Benchmark Library for Parametric Timed Model Checking [chapter]

Étienne André
2019 Communications in Computer and Information Science  
Verification of real-time systems involving hard timing constraints and concurrency is of utmost importance.  ...  Parametric timed model checking allows for formal verification in the presence of unknown timing constants or uncertainty (e. g., imprecision for periods).  ...  This is the author version of the manuscript of the same name published in the proceedings of the Sixth International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2018).  ... 
doi:10.1007/978-3-030-12988-0_5 fatcat:5knf3fthu5ehdhe5n2vnbrclua

Author index

2004 Theoretical Computer Science  
Yen, Reachability solution characterization of parametric real-time systems (1-2) 187-201 Xie, G., C. Li and Z.  ...  Dang, Linear reachability problems and minimal solutions to linear Diophantine equation systems (1-2) 203-219 Yen, H.-C., see F. Wang (1-2) 187-201 You, J.-H., see Y.-D. Shen (3) 271-287 Yuan, L.  ... 
doi:10.1016/s0304-3975(04)00751-0 fatcat:weaueldicfa4ze345ivqihpoh4

Timed Orchestration for Component-based Systems [article]

Chih-Hong Cheng, Lacramioara Astefanoaei, Harald Ruess, Souha Ben Rayana, Saddek Bensalem
2016 arXiv   pre-print
We formalize this problem of configuring and orchestrating flexible production lines as a parameter synthesis problem for systems of parametric timed automata, where interactions are based on skills.  ...  For constraint generation, we provide a set of computationally cheap over-approximations of the set of reachable states, together with fence constructions as sufficient conditions for safety formulas.  ...  Zone graphs are symbolic representations of the reachable state space of parametric timed automata. In practice, easier solutions work as well. One example is the tactic 1 in Figure 3 .  ... 
arXiv:1504.05513v3 fatcat:nv6nvira5vegrln2ah4ixglumq

The reachability and observability of hybrid multirate sampling linear systems

M. de la Sen
1996 Computers and Mathematics with Applications  
This paper investigates algebraic sufficient, necessary, and sufficient conditions for sampling time reachability and observability in hybrid multirate sampling data linear systems for the cases of fast  ...  Some implications in the context of closed-loop pole-placement under both properties under multirate sampling are heuristically discussed.  ...  Note that the effective effect of equations (3.5)-(3.7) for reachability characterization of the given class of hybrid systems is that the number of columns of the reachability matrix in (3.6), redefined  ... 
doi:10.1016/0898-1221(95)00185-2 fatcat:6y6f3dt65jc3nnf7s5n6vixwuy
« Previous Showing results 1 — 15 out of 6,876 results