Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q5299841): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q51540612, #quickstatements; #temporary_batch_1708296850199 |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / author | |||
| Property / author: Li-jun Zhang / rank | |||
| Property / author | |||
| Property / author: Li-jun Zhang / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 20:41, 5 March 2024
scientific article; zbMATH DE number 6179921
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bisimulations Meet PCTL Equivalences for Probabilistic Automata |
scientific article; zbMATH DE number 6179921 |
Statements
Bisimulations Meet PCTL Equivalences for Probabilistic Automata (English)
0 references
24 June 2013
0 references
probabilistic computation tree logic
0 references
PCTL
0 references
probabilistic automata
0 references
characterization
0 references
bisimulation
0 references
behavioral equivalence
0 references
