Faster algorithms for alternating refinement relations
IST Austria Technical Report
Chatterjee, Krishnendu
Chaubal, Siddhesh
Kamath, Pritish
ddc:000
ddc:005
One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm.
IST Austria
2012
info:eu-repo/semantics/technical_report
doc-type:other
text
https://research-explorer.app.ist.ac.at/record/5378
https://research-explorer.app.ist.ac.at/download/5378/5489
Chatterjee K, Chaubal S, Kamath P. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria; 2012. doi:<a href="https://doi.org/10.15479/AT:IST-2012-0001">10.15479/AT:IST-2012-0001</a>
eng
info:eu-repo/semantics/altIdentifier/doi/10.15479/AT:IST-2012-0001
info:eu-repo/semantics/altIdentifier/issn/2664-1690
info:eu-repo/semantics/openAccess