Team equivalences for finite-state machines with silent moves (Q2216117)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7285760
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Team equivalences for finite-state machines with silent moves |
scientific article; zbMATH DE number 7285760 |
Statements
Team equivalences for finite-state machines with silent moves (English)
0 references
15 December 2020
0 references
Petri nets
0 references
finite-state machines
0 references
truly concurrent semantics
0 references
weak bisimulation
0 references
branching bisimulation
0 references
equivalence checking
0 references
axiomatization
0 references
0 references
0 references
0.8154923915863037
0 references
0.743979275226593
0 references
0.7364210486412048
0 references
0.7323589324951172
0 references
