Exact and Fully Symbolic Verification of Linear Hybrid Automata with Large 
Discrete State Spaces

Damm, Werner; Dierks, Henning; Disch, Stefan; Hagemann, Willem; Pigorsch, Florian; Scholl, Christoph; Waldmann, Uwe; Wirtz, Boris

doi:10.1016/j.scico.2011.07.006

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1562758_4

DetailsSummary

Released

Journal Article

Exact and Fully Symbolic Verification of Linear Hybrid Automata with Large Discrete State Spaces

MPS-Authors

/persons/resource/persons44562

Hagemann, Willem
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45689

Waldmann, Uwe
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Damm, W., Dierks, H., Disch, S., Hagemann, W., Pigorsch, F., Scholl, C., et al. (2012). Exact and Fully Symbolic Verification of Linear Hybrid Automata with Large Discrete State Spaces. Science of Computer Programming, 77, 1122-1150. doi:10.1016/j.scico.2011.07.006.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-14F1-8

Abstract

There is no abstract available