Proving finiteness of CCS processes by non-standard semantics (Q1323345): Difference between revisions

@@ Property / author @@
-Nicoletta De Francesco
@@ Property / author: Nicoletta De Francesco / rank @@
-Normal rank
@@ Property / author @@
+Nicoletta De Francesco
@@ Property / author: Nicoletta De Francesco / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+LOTOS
@@ Property / describes a project that uses: LOTOS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Process algebra for synchronous communication
@@ Property / cites work: Process algebra for synchronous communication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038723
@@ Property / cites work: Q4038723 / rank @@
+Normal rank
@@ Property / cites work @@
+CCS expressions, finite state processes, and three problems of equivalence
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite representations of CCS and TCSP programs by automata and Petri nets
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1323345