A short proof of the decidability of bisimulation for normed BPA- processes (Q1198053): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3774929 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphes canoniques de graphes algébriques / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Actions speak louder than words: proving bisimilarity for context-free processes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3907077 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90142-i / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008587618 / rank | |||
Normal rank | |||
Latest revision as of 10:34, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short proof of the decidability of bisimulation for normed BPA- processes |
scientific article |
Statements
A short proof of the decidability of bisimulation for normed BPA- processes (English)
0 references
16 January 1993
0 references
formal semantics
0 references
basic progress algebra
0 references
context-free processes
0 references
decidability
0 references
decidability of bisimulation
0 references
