The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Observability and controllability of piecewise affine and hybrid systems
Open accessAbstract
We prove, in a constructive way, the equivalence between piecewise affine systems and a broad class of hybrid systems described by interacting linear dynamics, automata, and propositional logic. By focusing our investigation on the former class, we show through counterexamples that observability and controllability properties cannot be easily deduced from those of the component linear subsystems. Instead, we propose practical numerical tests based on mixed-integer linear programming.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Variable structure systems with sliding modes
Utkin, V. (1977) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1977.1101446 · Cited by 5,367
Multiple Lyapunov functions and other analysis tools for switched and hybrid systems
Branicky, M. S. (1998) · IEEE Transactions on Automatic Control · doi:10.1109/9.664150 · Cited by 3,281
Control of systems integrating logic, dynamics, and constraints
Bemporad, A., & Morari, M. (1999) · Automatica · doi:10.1016/s0005-1098(98)00178-2 · Cited by 3,066
Self-citationA Unified Framework for Hybrid Control: Model and Optimal Control Theory
Branicky, M. S., Borkar, V. S., & Mitter, S. K. (1998) · IEEE Transactions on Automatic Control · doi:10.1109/9.654885 · Cited by 1,313
Model Building in Mathematical Programming
Maher, M. J., & Williams, H. P. (1979) · Journal of the Operational Research Society · doi:10.2307/3009304 · Cited by 1,245
Sontag, E. D. (1998) · Texts in Applied Mathematics · doi:10.1007/978-1-4612-0577-7 · Cited by 1,226
Computation of piecewise quadratic Lyapunov functions for hybrid systems
Johansson, M., & Rantzer, A. (1998) · IEEE Transactions on Automatic Control · doi:10.1109/9.664157 · Cited by 1,222
Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems
Alur, R., Courcoubetis, C., Henzinger, T. A., & Ho, P. H. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57318-6_30 · Cited by 1,106
Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications
Floudas, C. A. (1995) · Oxford University Press eBooks · doi:10.1093/oso/9780195100563.001.0001 · Cited by 975
Keerthi, S. S., & Gilbert, E. G. (1988) · Journal of Optimization Theory and Applications · doi:10.1007/bf00938540 · Cited by 824
Nonlinear regulation: The piecewise linear approach
Sontag, E. D. (1981) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1981.1102596 · Cited by 813
Controllers for reachability specifications for hybrid systems
Lygeros, J., Tomlin, C., & Sastry, S. (1999) · Automatica · doi:10.1016/s0005-1098(98)00193-9 · Cited by 608
What's decidable about hybrid automata?
Henzinger, T. A., Kopke, P. W., Puri, A., & Varaiya, P. P. (1995) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/225058.225162 · Cited by 520
Relation between MILP modelling and logical inference for chemical process synthesis
Raman, R., & Grossmann, I. E. (1991) · Computers & Chemical Engineering · doi:10.1016/0098-1354(91)87007-v · Cited by 285
Nonlinear Moving Horizon State Estimation
Muske, K. R., & Rawlings, J. B. (1995) · Springer eBooks · doi:10.1007/978-94-011-0135-6_14 · Cited by 140
Propositional logic in control and monitoring problems
Tyler, M. L., & Morari, M. (1999) · Automatica · doi:10.1016/s0005-1098(98)00198-8 · Cited by 125
Self-citationModel building in mathematical programming
(1992) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)90184-c · Cited by 83
Controllability is Harder to Decide than Accessibility
Sontag, E. D. (1988) · SIAM Journal on Control and Optimization · doi:10.1137/0326061 · Cited by 55
A framework for control, fault detection, state estimation, and verification of hybrid systems
Mignone, D., Bemporad, A., & Morari, M. (1999) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.1999.782755 · Cited by 45
Self-citation
Cited by
Stability and Stabilizability of Switched Linear Systems: A Survey of Recent Results
Lin, H., & Antsaklis, P. J. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2012009 · Cited by 2,671
Predictive Control for Linear and Hybrid Systems
Borrelli, F., Bemporad, A., & Morari, M. (2017) · Cambridge University Press eBooks · doi:10.1017/9781139061759 · Cited by 1,443
Self-citationConstrained Optimal Control of Linear and Hybrid Systems
(2003) · Lecture Notes in Control and Information Sciences · doi:10.1007/3-540-36225-8 · Cited by 429
Identification of piecewise affine systems via mixed-integer programming
Roll, J., Bemporad, A., & Ljung, L. (2004) · Automatica · doi:10.1016/j.automatica.2003.08.006 · Cited by 386
Self-citationRobust constraint satisfaction: invariant sets and predictive control
Kerrigan, E. C. (2000) · doi:10.25561/4346 · Cited by 376
Metadata
- Authors
- Bemporad, A., Ferrari-Trecate, G., & Morari, M.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2000-10
- Volume
- 45
- Issue
- 10
- Pages
- 1864-1876
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2562854303
- Cited by
- 633
- References
- 19
- FWCI
- 60.83
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.