A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (Q4715674): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Q197787 / rank | |||
Property / author | |||
Property / author: Mark R. Jerrum / rank | |||
Property / author | |||
Property / author: Faron Moller / rank | |||
Property / author | |||
Property / author: Joram Hirschfeld / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Mark R. Jerrum / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Faron Moller / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59556998 / rank | |||
Normal rank | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1017/s0960129500000992 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2137502532 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:49, 30 July 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