English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

Comparing Asynchronous l-Complete Approximations and Quotient Based Abstractions

MPS-Authors
/persons/resource/persons188484

Schmuck,  Anne-Kathrin
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

arXiv:1503.07139.pdf
(Preprint), 291KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Schmuck, A.-K., Tabuada, P., & Raisch, J. (2015). Comparing Asynchronous l-Complete Approximations and Quotient Based Abstractions. Retrieved from http://arxiv.org/abs/1503.07139.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0029-6733-2
Abstract
This paper is concerned with a detailed comparison of two different abstraction techniques for the construction of finite state symbolic models for controller synthesis of hybrid systems. Namely, we compare quotient based abstractions (QBA), with different realizations of strongest (asynchronous) $l$-complete approximations (SAlCA) Even though the idea behind their construction is very similar, we show that they are generally incomparable both in terms of behavioral inclusion and similarity relations. We therefore derive necessary and sufficient conditions for QBA to coincide with particular realizations of SAlCA. Depending on the original system, either QBA or SAlCA can be a tighter abstraction.