Timeline for Transition System vs State Machines
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 1, 2022 at 22:30 | comment | added | D.W.♦ | @JahidChowdhuryChoton, that might depend on the specific definition used. Please adjust accordingly. Regarding your last question, see the first sentence of my answer. | |
| Aug 1, 2022 at 20:20 | comment | added | Jahid Chowdhury Choton | You said ignoring the initial or final states, but transition system and DFA both has initial states. A transition system is a Tuple (S, Act, ->, s0, L) which is defined in one of the model checking book I am reading (s0 is the initial state). (Book name: Principles of Model Checking by Christel Baier) But there are no final states. But in Wikipedia there are no initial states in transition systems. I'm a little bit out due to several different definitions. As you said I can make a DFA from labelled TS, but can I make the opposite? (Finite Machine to Transition System?) | |
| Aug 1, 2022 at 20:05 | history | answered | D.W.♦ | CC BY-SA 4.0 |