Algorithmic algebraic model checking III: Approximate methods

Venkatesh Mysore; Bud Mishra

doi:10.1016/j.entcs.2005.11.017

Algorithmic algebraic model checking III: Approximate methods

Venkatesh Mysore, Bud Mishra

Computer Science

Research output: Contribution to journal › Conference article › peer-review

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 language	English (US)
Pages (from-to)	61-77
Number of pages	17
Journal	Electronic Notes in Theoretical Computer Science
Volume	149
Issue number	1
DOIs	https://doi.org/10.1016/j.entcs.2005.11.017
State	Published - Feb 3 2006
Event	Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY 2005) - Duration: Aug 27 2005 → Aug 27 2005

Keywords

Model checking
Semi-algebraic hybrid systems

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.entcs.2005.11.017

Cite this

@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 Bud Mishra",

note = "Funding Information: 1 The work reported in this paper was supported by grants from NSF{\textquoteright}s ITR program and DARPA{\textquoteright}s BioCOMP program. 2 Email: [email protected] 3 Email: [email protected]; Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY 2005) ; Conference date: 27-08-2005 Through 27-08-2005",

year = "2006",

month = feb,

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 B.V.",

number = "1",

}

TY - JOUR

T1 - Algorithmic algebraic model checking III

T2 - Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY 2005)

AU - Mysore, Venkatesh

AU - Mishra, Bud

N1 - Funding Information: 1 The work reported in this paper was supported by grants from NSF’s ITR program and DARPA’s BioCOMP program. 2 Email: [email protected] 3 Email: [email protected]

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 - Conference article

AN - SCOPUS:31144441911

SN - 1571-0661

VL - 149

SP - 61

EP - 77

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

IS - 1

Y2 - 27 August 2005 through 27 August 2005

ER -

Algorithmic algebraic model checking III: Approximate methods

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this