marcorealacci/master-degree-notes
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

vault backup: 2025-04-08 09:36:02

Browse source
This commit is contained in:
Marco Realacci 2025-04-08 09:36:02 +02:00
parent d646f82f73
commit 05c144a5d1
1 changed files with 10 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

10
Concurrent Systems/notes/11 - non so cosa faremo oggi.md
View file

@ -23,3 +23,13 @@ The essence of the difference is WHEN the decision to branch is taken
- language equivalence gets rid of branching points - language equivalence gets rid of branching points
- it is too coarse for our purposes! - it is too coarse for our purposes!
### LTSs
In concurrency theory, we don’t use finite automata but Labeled Transition System (LTS). The main differences between the two formalisms are:
- automata usually rely on a finite number of states, whereas states of an LTS can be infinite
- automata fix one starting state, whereas in an LTS every state can be considered as initial (this corresponds to different possible behaviors of the process)
- automata rely on final states for describing the language accepted, whereas in LTS this notion is not very informative
Fix a set of action names (or, simply, actions), written N.
>[!note] LTS formal definition
>A Labeled Transition System (LTS) is a pair (Q, T), where Q is the set of states and T is the transition relation (T ⊆ Q × N × Q).