English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. Item Summary / 
  2. View item

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Comparing Asynchronous l-Complete Approximations and Quotient Based Abstractions

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0029-6733-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0029-6734-F
Genre: Paper
Latex : Comparing Asynchronous $l$-Complete Approximations and Quotient Based Abstractions

Files

show Files
hide Files
:
arXiv:1503.07139.pdf (Preprint), 291KB
View   Save
File Permalink:
https://hdl.handle.net/11858/00-001M-0000-0029-6735-D
Name:
arXiv:1503.07139.pdf
Description:
File downloaded from arXiv at 2016-01-25 12:59
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
http://arxiv.org/help/license

Locators

show

Creators

show
hide
 Creators:
Schmuck, Anne-Kathrin1, Author           
Tabuada, Paulo2, Author
Raisch, Jörg2, Author
Affiliations:
1Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society, ou_2105292              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: cs.SY,Computer Science, Logic in Computer Science, cs.LO
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2015-03-242015-07-272015
 Publication Status: Published online
 Pages: 22 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: arXiv: 1503.07139
URI: http://arxiv.org/abs/1503.07139
 Degree: -

Event

show

Legal Case

show

Project information

show

Source

show