Search

• < Previous
• 1
• Next >

---

Well Behaved Transition Systems

Michael Blondin ; Alain Finkel ; Pierre McKenzie.

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&nbsp;[&hellip;]

---

Synchronizability of Communicating Finite State Machines is not Decidable

Alain Finkel ; Etienne Lozes.

A system of communicating finite state machines is synchronizable if its send trace semantics, i.e.the set of sequences of sendings it can perform, is the same when its communications are FIFO asynchronous and when they are just rendez-vous synchronizations. This property was claimed to be decidable&nbsp;[&hellip;]

---