Well Behaved Transition Systems
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 transi...
| Autors principals: | , , |
|---|---|
| Format: | Article |
| Idioma: | English |
| Publicat: |
Logical Methods in Computer Science e.V.
2017-09-01
|
| Col·lecció: | Logical Methods in Computer Science |
| Matèries: | |
| Accés en línia: | https://lmcs.episciences.org/3928/pdf |