Proving finiteness of CCS processes by non-standard semantics (Q1323345): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Process algebra for synchronous communication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4038723 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992568 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finite representations of CCS and TCSP programs by automata and Petri nets / rank | |||
Normal rank | |||
Latest revision as of 15:46, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proving finiteness of CCS processes by non-standard semantics |
scientific article |
Statements
Proving finiteness of CCS processes by non-standard semantics (English)
0 references
10 May 1994
0 references
verification of programs
0 references
CCS
0 references
operational semantics
0 references
