Algorithmic algebraic model checking III: Approximate methods

Venkatesh Mysore, Bhubaneswar Mishra

Research output: Contribution to journalArticle

Abstract

We present computationally efficient techniques for approximate model-checking using bisimulation-partitioning, polyhedra, grids and time discretization for semi-algebraic hybrid systems, and demonstrate how they relate to and extend other existing techniques.

Original languageEnglish (US)
Pages (from-to)61-77
Number of pages17
JournalElectronic Notes in Theoretical Computer Science
Volume149
Issue number1
DOIs
StatePublished - Feb 3 2006

Fingerprint

Model checking
Hybrid systems
Model Checking
Approximate Model
Bisimulation
Time Discretization
Hybrid Systems
Polyhedron
Partitioning
Grid
Demonstrate

Keywords

  • Model checking
  • Semi-algebraic hybrid systems

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Algorithmic algebraic model checking III : Approximate methods. / Mysore, Venkatesh; Mishra, Bhubaneswar.

In: Electronic Notes in Theoretical Computer Science, Vol. 149, No. 1, 03.02.2006, p. 61-77.

Research output: Contribution to journalArticle

@article{15e29eda5e924e348e70e105c2c70928,
title = "Algorithmic algebraic model checking III: Approximate methods",
abstract = "We present computationally efficient techniques for approximate model-checking using bisimulation-partitioning, polyhedra, grids and time discretization for semi-algebraic hybrid systems, and demonstrate how they relate to and extend other existing techniques.",
keywords = "Model checking, Semi-algebraic hybrid systems",
author = "Venkatesh Mysore and Bhubaneswar Mishra",
year = "2006",
month = "2",
day = "3",
doi = "10.1016/j.entcs.2005.11.017",
language = "English (US)",
volume = "149",
pages = "61--77",
journal = "Electronic Notes in Theoretical Computer Science",
issn = "1571-0661",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Algorithmic algebraic model checking III

T2 - Approximate methods

AU - Mysore, Venkatesh

AU - Mishra, Bhubaneswar

PY - 2006/2/3

Y1 - 2006/2/3

N2 - We present computationally efficient techniques for approximate model-checking using bisimulation-partitioning, polyhedra, grids and time discretization for semi-algebraic hybrid systems, and demonstrate how they relate to and extend other existing techniques.

AB - We present computationally efficient techniques for approximate model-checking using bisimulation-partitioning, polyhedra, grids and time discretization for semi-algebraic hybrid systems, and demonstrate how they relate to and extend other existing techniques.

KW - Model checking

KW - Semi-algebraic hybrid systems

UR - http://www.scopus.com/inward/record.url?scp=31144441911&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=31144441911&partnerID=8YFLogxK

U2 - 10.1016/j.entcs.2005.11.017

DO - 10.1016/j.entcs.2005.11.017

M3 - Article

AN - SCOPUS:31144441911

VL - 149

SP - 61

EP - 77

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

IS - 1

ER -