About: Formal Analysis of Piecewise Affine Systems through Formula-Guided Refinement

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Formal Analysis of Piecewise Affine Systems through Formula-Guided Refinement Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Logic (LTL) formula over a set of linear predicates in its state variables. Our approach is based on the construction and refinement of finite abstractions of infinite systems. We derive conditions guaranteeing the equivalence of an infinite system and its finite abstraction with respect to a specific temporal logic formula and propose methods aimed at the construction of such formula-equivalent abstractions. We show that the proposed procedure can be implemented using polyhedral operations and analysis of finite graphs. While provably correct, the overall method is conservative and expensive. The proposed algorithms have been implemented as a software tool that is available for download. An illustrative example for a PWA gene network model is included. We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Logic (LTL) formula over a set of linear predicates in its state variables. Our approach is based on the construction and refinement of finite abstractions of infinite systems. We derive conditions guaranteeing the equivalence of an infinite system and its finite abstraction with respect to a specific temporal logic formula and propose methods aimed at the construction of such formula-equivalent abstractions. We show that the proposed procedure can be implemented using polyhedral operations and analysis of finite graphs. While provably correct, the overall method is conservative and expensive. The proposed algorithms have been implemented as a software tool that is available for download. An illustrative example for a PWA gene network model is included. (en)
Title	Formal Analysis of Piecewise Affine Systems through Formula-Guided Refinement Formal Analysis of Piecewise Affine Systems through Formula-Guided Refinement (en)
skos:prefLabel	Formal Analysis of Piecewise Affine Systems through Formula-Guided Refinement Formal Analysis of Piecewise Affine Systems through Formula-Guided Refinement (en)
skos:notation	RIV/00216224:14330/10:00045258!RIV11-GA0-14330___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GA201/09/1389), P(GP201/09/P497), S, Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Černá, Ivana Barnat, Jiří Tůmová, Jana
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	259539
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/10:00045258
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Automata; Genetic regulatory systems; Hybrid Systems (en)
http://linked.open.../riv/klicoveSlovo	Hybrid Systems Automata Genetic regulatory systems
http://linked.open...ontrolniKodProRIV	[126115C47A18]
http://linked.open...v/mistoKonaniAkce	Atlanta, GA, USA
http://linked.open...i/riv/mistoVydani	Neuveden
http://linked.open...i/riv/nazevZdroje	Proceedings of of the 49th IEEE Conference on Decision and Control (CDC)
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	Verification and Analysis of Large-Scale Computer Systems Automated formal verification using modern hardware
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Barnat, Jiří Černá, Ivana Belta, Calin Tůmová, Jana Yordanov, Boyan
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	00000
http://linked.open.../riv/zahajeniAkce	2010-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	0191-2216
number of pages	6 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Omnipress for IEEE Control Systems Society
https://schema.org/isbn	978-1-4244-7744-9
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software