A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (Q4715674): Difference between revisions

Revision as of 15:43, 24 May 2024

scientific article; zbMATH DE number 946746

Language	Label	Description	Also known as
English	A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes	scientific article; zbMATH DE number 946746

Statements

instance of

scholarly article

0 references

title

A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (English)

0 references

zbMATH Open document ID

0857.68042

0 references

DOI

10.1017/S0960129500000992

0 references

published in

Mathematical Structures in Computer Science

0 references

publication date

18 November 1996

0 references

Mathematics Subject Classification ID

0 references

0 references

basic parallel processes

0 references

polynomial-time algorithm

0 references

bisimulation

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

Wikidata QID

Q59556998

0 references

cites work

Algebra of communicating processes with abstraction

0 references

Decidability of bisimulation equivalence for process generating context-free languages

0 references

Unique decomposition of processes

0 references

Q3862379

0 references

A short proof of the decidability of bisimulation for normed BPA- processes

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4715674

@@ Property / author @@
-Q197787
@@ Property / author: Q197787 / rank @@
-Normal rank
@@ Property / author @@
-Mark R. Jerrum
@@ Property / author: Mark R. Jerrum / rank @@
-Normal rank
@@ Property / author @@
-Faron Moller
@@ Property / author: Faron Moller / rank @@
-Normal rank
@@ Property / author @@
+Joram Hirschfeld
@@ Property / author: Joram Hirschfeld / rank @@
+Normal rank
@@ Property / author @@
+Mark R. Jerrum
@@ Property / author: Mark R. Jerrum / rank @@
+Normal rank
@@ Property / author @@
+Faron Moller
@@ Property / author: Faron Moller / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59556998
@@ Property / Wikidata QID: Q59556998 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebra of communicating processes with abstraction
+Normal rank
@@ Property / cites work @@
+Decidability of bisimulation equivalence for process generating context-free languages
+Normal rank
@@ Property / cites work @@
+Unique decomposition of processes
@@ Property / cites work: Unique decomposition of processes / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+A short proof of the decidability of bisimulation for normed BPA- processes
+Normal rank