(Bi)simulation checking for Gap-order Systems

18^th August 2020, 11:00 Zoom
Isa Vialard

Abstract

Gap-order Systems are counter-automata with infinitely-branching updates of the form "next X at least C bigger than Y" for constants C and counters X,Y. The model allows for "efficient" (PSPACE) LTL and EC model checking, reachability analysis and
trace properties, yet the usually easier bisimulation/simulation checking are more tricky, which I think is intriguing.

Additional Materials

• https://cgi.csc.liv.ac.uk/~patrick/pub/journal/MT2016.html