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

vault backup: 2025-04-08 09:37:21

Browse source
This commit is contained in:
Marco Realacci 2025-04-08 09:37:21 +02:00
parent 05c144a5d1
commit 7f58845b20
2 changed files with 9 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

6
Concurrent Systems/notes/11 - non so cosa faremo oggi.md → Concurrent Systems/notes/11 - LTSs and Bisimulation.md
View file

@ -29,7 +29,11 @@ In concurrency theory, we don’t use finite automata but Labeled Transition Sys
- 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
>Fix a set of action names (or, simply, actions), written N.
>
>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).
We shall usually write s –a–> s′ instead of ⟨s,a,s′⟩ ∈ T.
### Bisimulation