vault backup: 2025-05-05 08:42:04

.obsidian/workspace.json

@@ -213,6 +213,7 @@
   },
   "active": "cdcc59f1bf6d4ae1",
   "lastOpenFiles": [
+    "Pasted image 20250505083948.png",
     "Concurrent Systems/slides/class 15.pdf",
     "Concurrent Systems/notes/15 - A formal language for LTSs.md",
     "Pasted image 20250505083500.png",

Concurrent Systems/notes/15 - A formal language for LTSs.md

@@ -11,3 +11,9 @@ These processes are not bisimilar as:
 - so there exists an a after which P1 cannot perform a b. But not for P2
 
 ### Syntax and Satisfiability
+$$\phi := TT | \lnot \phi | \phi \land \phi|◇ a \phi \quad where a \in Action$$
+The language generated by this grammar will be denoted by Form; every element of this set will be called formula
+
+![](../../Pasted%20image%2020250505083948.png)
+
+To simplify the proofs, we consider a more general form of conjunction: $\land_{i \in I, \phi i}$