Automated Predicate Abstraction for Real-Time Models
Bahareh Badban, Stefan Leue, Jan-Georg Smaus
Electronic Proceedings in Theoretical Computer Science · 2009
doi:10.4204/eptcs.10.3 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
We present a technique designed to automatically compute predicate abstractions for dense real-timed models represented as networks of timed automata. We use the CIPM algorithm in our previous work which computes new invariants for timed automata control locations and prunes the model, to compute a predicate abstraction of the model. We do so by taking information regarding control locations and their newly computed invariants into account.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.