Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Werner Damm, Henning Dierks, Stefan Disch, Willem Hagemann, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, Boris Wirtz. Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces. Science of Computer Programming, 77(10-11):1122-1150, 2012. [doi]

The following publications are possibly variants of this publication:

Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State SpaceWerner Damm, Stefan Disch, Hardi Hungar, Swen Jacobs, Jun Pang, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, Boris Wirtz. ATVA 2007: 425-440 [doi]

Decidability and complexity for the verification of safety properties of reasonable linear hybrid automataWerner Damm, Carsten Ihlemann, Viorica Sofronie-Stokkermans. hybrid 2011: 73-82 [doi]

runs on WebDSL