Domain Reduction Abstraction
Published Date
Publisher
Type
Abstract
We suggest "domain reduction abstraction" for model checking systems with numeric guarding conditions and data transition constraints. The technique abstracts the domain of data variables using "data equivalence" and "trajectory reduction" in order to reduce the (possibly infinite) state space. Earlier work introduced the technique for systems with no data constraints or deterministic data constraints. Here, we extend the work to "non-deterministic constrained data transition systems". We provide a formal definition andproof of the soundness of the technique, and illustrate the abstraction technique with a small example.
Keywords
Description
Related to
item.page.replaces
License
Series/Report Number
Technical Report; 02-013
Funding Information
item.page.isbn
DOI identifier
Previously Published Citation
Other identifiers
Suggested Citation
Choi, Yunja; Heimdahl, Mats; Rayadurgam, Sanjai. (2002). Domain Reduction Abstraction. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215517.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.