A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (Q4715674): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59556998, #quickstatements; #temporary_batch_1711574657256 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Algebra of communicating processes with abstraction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decidability of bisimulation equivalence for process generating context-free languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unique decomposition of 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: Q3862379 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A short proof of the decidability of bisimulation for normed BPA- processes / rank | |||
Normal rank |
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
A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (English)
0 references
18 November 1996
0 references
basic parallel processes
0 references
polynomial-time algorithm
0 references
bisimulation
0 references