DOI: 10.1007/978-3-540-78929-1_37
|View full text |Cite
|
Sign up to set email alerts
|

Bisimilar Finite Abstractions of Interconnected Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
73
0

Publication Types

Select...
5
2
1

Relationship

3
5

Authors

Journals

citations
Cited by 58 publications
(73 citation statements)
references
References 11 publications
0
73
0
Order By: Relevance
“…If one knows the internal interconnection structure of a complex system, it is natural to take advantage of such knowledge to reduce the complexity of the computation of the abstraction process and that of the resultant abstraction itself. In [6], it was shown that the conventional approximate bisimulation is not preserved under interconnection. moreover, in the same work, the notion of interconnection-compatible (IC-)approximate bisimulation has been presented.…”
Section: Introductionmentioning
confidence: 98%
See 2 more Smart Citations
“…If one knows the internal interconnection structure of a complex system, it is natural to take advantage of such knowledge to reduce the complexity of the computation of the abstraction process and that of the resultant abstraction itself. In [6], it was shown that the conventional approximate bisimulation is not preserved under interconnection. moreover, in the same work, the notion of interconnection-compatible (IC-)approximate bisimulation has been presented.…”
Section: Introductionmentioning
confidence: 98%
“…Once a finite abstraction of each subsystem is designed based on IC-approximate bisimulation and a certain compatibility criteria is fulfilled, we can simply interconnect subsystems to form a finite abstraction of the entire concrete system. However, an analytical condition on a quantizer derived in [6] has some limitations. First, it is based on infinite-horizon approximate bisimulation.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…To overcome the hardness of analysis/synthesis of complex systems, recently, there have been several works on finite-state approximations such as (bi)simulation relations (e.g., Girard et al 2008;Tazaki and Imura 2008) and qualitative models (e.g., Batt et al 2005;Chaves et al 2009). In these approaches, dynamical systems are approximated by finite automata (directed graphs), and the analysis/control problems of them are in general reduced to a kind of search problems on graphs.…”
Section: Introductionmentioning
confidence: 99%
“…Abstractions for nonlinear systems include (Reissig, 2011), which is focused on general discrete time systems and (Abate et al, 2009), where box abstractions are derived for polynomial and other classes of systems. Furthermore, abstractions for interconnected systems have been recently developed in (Tazaki and Imura, 2008;Pola et al, 2014Pola et al, , 2016Rungger and Zamani, 2015;Meyer et al, 2015;Dallal and Tabuada, 2015) and are primarily based on small gain criteria. In this work we consider multi-agent systems and provide an online abstraction methodology which enables the exploitation of the system's dynamic properties over bounded reachable sets.…”
Section: Introductionmentioning
confidence: 99%