Well Behaved Transition Systems

12 Sep 2017 Blondin Michael Finkel Alain McKenzie Pierre

The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem. We show coverability decidable for monotone transition systems that only require the absence of infinite antichains and call well behaved transitions systems (WBTS) the new strict superclass of the class of WSTS that arises... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • LOGIC IN COMPUTER SCIENCE

Datasets


  Add Datasets introduced or used in this paper