Filters








252,841 Hits in 3.3 sec

Development of Model Checker of Dynamic Linear Hybrid Automata

Ryo Yanase, Tatsunori Sakai, Makoto Sakai, Satoshi Yamane
2013 2013 IEEE 37th Annual Computer Software and Applications Conference  
A dynamic linear hybrid automaton(DLHA) is a linear hybrid automaton extended with actions of creation and destruction.  ...  In this study, we propose dynamic linear hybrid automata as specification language of dynamically reconfigurable systems and the verification technique of reachability analysis.  ...  Fig. 1 shows examples of dynamic linear hybrid automata. Actions are described by CSP style. Q!A 3 and Q?A 3 are actions for operating queue of the system.  ... 
doi:10.1109/compsac.2013.98 dblp:conf/compsac/YanaseSSY13 fatcat:vm7nysg65fatnm3xhen3eovjai

Action Systems with Continuous Behaviour [chapter]

Mauno Rönkkö, Anders P. Ravn
1999 Lecture Notes in Computer Science  
We also extend parallel composition to hybrid action systems.  ...  The extension gives action systems the power to model real-time clocks and continuous evolutions within hybrid systems. In this paper we give a standard form for such a hybrid action system.  ...  It has also been supported by the European Commission under Grant EC-US 043 Hybrid NSF. We would also like to thank the organisers of HS'97 for support.  ... 
doi:10.1007/3-540-49163-5_17 fatcat:noea3s3vqrgmhkyxwileip6q2m

Translation from ECML to Linear Hybrid Automata [chapter]

Jaeyeon Jo, Junbeom Yoo, Han Choi, Sungdeok Cha, Hae Young Lee, Won-Tae Kim
2012 Lecture Notes in Electrical Engineering  
DEV & DESS -Proposed by ETRI in Korea • Formal Verification of ECML -Needs algorithmic method for verifying ECML Introduction • Hybrid Automata -Formal model for hybrid systemsLinear Hybrid Automata  ...  (LHA) -Restricted Hybrid Automata using linear dynamics • If = and is not constant, it is not linearity(x). • If = + and b and c is constant, it is linearity(o). -• Generate a transition in discrete  ... 
doi:10.1007/978-94-007-5076-0_34 fatcat:mtghusllareofjxkgzr7ynpb7u

Extended Radial Basis Function Controller for Reinforcement Learning [article]

Nicholas Capel, Naifu Zhang
2020 arXiv   pre-print
The linear controller is designed based on local linearised model knowledge, and stabilises the system in a neighbourhood about an operating point.  ...  This paper proposes a hybrid reinforcement learning controller which dynamically interpolates a model-based linear controller and an arbitrary differentiable policy.  ...  In general, the closer the system is to the operating point, the more the hybrid controller is to approximate the linear controller.  ... 
arXiv:2009.05866v2 fatcat:ctqc47yqgzbffbkvijgpezsj6e

Hybrid Reinforcement Learning and Its Application to Biped Robot Control

Satoshi Yamada, Akira Watanabe, Michio Nakashima
1997 Neural Information Processing Systems  
A learning system composed of linear control modules, reinforcement learning modules and selection modules (a hybrid reinforcement learning system) is proposed for the fast learning of real-world control  ...  This hybrid learning system was applied to the control of a stilt-type biped robot.  ...  It is called the hybrid reinforcement learning system. One example of a known controller is a linear controller obtained by linear approximation.  ... 
dblp:conf/nips/YamadaWN97 fatcat:jyu7u2snjbh3bh74tfder6bt6y

Hybrid control trajectory optimization under uncertainty [article]

Joni Pajarinen, Ville Kyrki, Michael Koval, Siddhartha Srinivasa, Jan Peters, Gerhard Neumann
2017 arXiv   pre-print
., hybrid, controls. Finding an optimal sequence of hybrid controls is challenging due to the exponential explosion of discrete control combinations.  ...  force the mixtures into fully discrete actions.  ...  In this paper, we investigate systems with non-linear dynamics and long sequences of hybrid controls and states (trajectories).  ... 
arXiv:1702.04396v2 fatcat:x7faj3ozcjb5xd52h46edjafya

Hybrid systems and quantum automata: Preliminary announcement [chapter]

R. L. Grossman, M. Sweedler
1995 Lecture Notes in Computer Science  
These types of systems have become known as hybrid systems and are examples of formal systems with commutative R.  ...  In this paper, we present a number of examples of hybrid systems and quantum automata and point out some relationships between them.  ...  The action v extends to all of X by linearity. Also, by linearity the action h extends to all h ∈ H. One can check that the suffix action makes X an H-module in that (uv) w = u (v w), for .  ... 
doi:10.1007/3-540-60472-3_10 fatcat:lx3z7zidwjfvddiknyw7khpvtu

Hybrid control trajectory optimization under uncertainty

Joni Pajarinen, Ville Kyrki, Michael Koval, Siddhartha Srinivasa, Jan Peters, Gerhard Neumann
2017 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)  
force the mixtures into fully discrete actions.  ...  Our method, based on Differential Dynamic Programming (DDP), circumvents this problem by incorporating discrete actions inside DDP: we first optimize continuous mixtures of discrete actions, and, subsequently  ...  In this paper, we investigate systems with non-linear dynamics and long sequences of hybrid controls and states (trajectories).  ... 
doi:10.1109/iros.2017.8206460 dblp:conf/iros/PajarinenKKS0N17 fatcat:tz7w4kpzmrcnfjfpkz2snxxouy

Relating Hybrid Chi to Other Formalisms

D.A. van Beek, J.E. Rooda, R.R.H. Schiffelers, K.L. Man, M.A. Reniers
2007 Electronical Notes in Theoretical Computer Science  
The hybrid χ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems.  ...  Then, the χ formalism is related to other formalisms by means of translation schemes: a translation scheme from continuous-time PWA systems to χ, a translation scheme from discrete-time PWA systems to  ...  Finally, in [41] , linear hybrid action systems have been shown to be a strict subclass of linear hybrid automata, and a translation of a linear hybrid action system, with proof of correctness, to a linear  ... 
doi:10.1016/j.entcs.2006.09.041 fatcat:hsmrljtlm5d5ne2v4n2mmoznoa

Hybrid automata with finite bisimulations [chapter]

Thomas A. Henzinger
1995 Lecture Notes in Computer Science  
In this fashion, we obtain new decidability results for hybrid systems as well as new, uniform proofs of known decidability results.  ...  The analysis, veri cation, and control of hybrid automata with nite bisimulations can be reduced to nite-state problems.  ...  Our view of hybrid systems has been shaped in collaboration with many people, including Rajeev Alur, Costas Courcoubetis, Pei-Hsin Ho, Peter Kopke, Amir Pnueli, Joseph Sifakis, Anuj Puri, and Pravin Varaiya  ... 
doi:10.1007/3-540-60084-1_85 fatcat:rgq4jxudqraqddowj7xh4p765e

An SMT-based Approach to analyze Non-Linear Relations of Parameters for Hybrid Systems [chapter]

Xian Li, Klaus Schneider
2015 Formal Modeling and Verification of Cyber-Physical Systems  
Deriving constraints over parameters to avoid unexpected system behaviors is extremely important for parametric analysis of hybrid systems.  ...  In the long run, our project aims for an SMT-based approach to reveal non-linear relations between parameters for hybrid systems that are specified by parameterized formal models using standard data types  ...  It provides algorithms that translate a Hybrid Quartz program to a set of guarded actions [18] . The guarded actions are the basis for the system's symbolic representation [1] .  ... 
doi:10.1007/978-3-658-09994-7_16 dblp:conf/syde/Li015 fatcat:r52okxrrdbce3d4gm2kl6m6wmi

Hybrid Reinforcement/Supervised Learning of Dialogue Policies from Fixed Data Sets

James Henderson, Oliver Lemon, Kallirroi Georgila
2008 Computational Linguistics  
We also use linear function approximation to address the need to generalize from a fixed amount of data to large state spaces.  ...  It also outperforms the hand-crafted systems on the COMMUNICATOR data, according to automatic evaluation measures, improving over the average COMMUNICATOR system policy by 10%.  ...  partially supported by the European Commission under the FP6 project "TALK: Talk and Look, Tools for Ambient Linguistic Knowledge" (507802) and the FP7 project "CLASSIC: Computational Learning in Adaptive Systems  ... 
doi:10.1162/coli.2008.07-028-r2-05-82 fatcat:5japk3poszg7xfnjexa54sqhw4

Page 508 of Computational Linguistics Vol. 34, Issue 4 [page]

2008 Computational Linguistics  
The best hybrid policy improves over the average COMMUNICATOR system policy by 10% on our metric.  ...  In addition, according to our automatic evaluation method, the hybrid RL/SL policy outperforms the systems used to generate the data.  ... 

Representing Hybrid Automata by Action Language Modulo Theories [article]

Joohyung Lee, Nikhil Loney, Yunsong Meng
2017 arXiv   pre-print
We first show how to represent linear hybrid automata with convex invariants by an action language modulo theories.  ...  Both hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them.  ...  Acknowledgements: We are grateful to Sicun Gao and Soonho Kong for their help on running dReal and dReach systems, to Daniel Bryce for his help with benchmark problems, and the anonymous referees for their  ... 
arXiv:1707.06387v2 fatcat:wiukesserffsjobt5sum562ly4

Weak refinement for modal hybrid systems [chapter]

Carsten Weise, Dirk Lenzkes
1997 Lecture Notes in Computer Science  
The algorithm has already been implemented for parametrized modal timed automata, a subclass of modal linear hybrid systems.  ...  We also explain how to adopt an improved algorithm for the decision of weak re nement for timed modal speci cations to modal linear hybrid systems, which offers the possibility of automatic veri cation  ...  This algorithm can be extended to modal linear hybrid systems. In the following sections we give application examples of modal hybrid systems.  ... 
doi:10.1007/bfb0014735 fatcat:3pgized2ljh4lf3gm2yktz6ase
« Previous Showing results 1 — 15 out of 252,841 results