Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement (Q5738963): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/566385.566386 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055350841 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:51, 20 March 2024
scientific article; zbMATH DE number 6729772
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement |
scientific article; zbMATH DE number 6729772 |
Statements
Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement (English)
0 references
13 June 2017
0 references
action refinement
0 references
ST bisimulation
0 references
axiomatization
0 references
noninterleaving semantics
0 references
process algebra
0 references
