Deriving Discrete Behavior of Hybrid Systems under Incomplete Knowledge
スポンサーリンク
概要
- 論文の詳細を見る
We study analysis of hybrid systems under incomplete knowledge. The class of hybrid systems to be considered is assumed to have the form of a rectangular hybrid automaton such that each constant in invariants and guards is given as a parameter. We develop a method based on symbolic computation that computes an approximation of the discrete behavior of the automaton. We also show an implementation on a constraint logic programming language.
- 一般社団法人電子情報通信学会の論文
- 2004-11-01
著者
関連論文
- An Efficient Algorithm for Exploring State Spaces of Petri Nets with Large Capacities (Special Section on Concurrent Systems Technology)
- An Algorithm for Legal Firing Sequence Problem of Petri Nets Based on Partial Order Method
- A Note on the Complexity of k-Ary Threshold Circuits
- Deriving Discrete Behavior of Hybrid Systems under Incomplete Knowledge