vault backup: 2025-05-05 08:42:04
This commit is contained in:
parent
421596b214
commit
eeeab36055
3 changed files with 7 additions and 0 deletions
|
@ -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
|
||||
|
||||

|
||||
|
||||
To simplify the proofs, we consider a more general form of conjunction: $\land_{i \in I, \phi i}$
|
Loading…
Add table
Add a link
Reference in a new issue