A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
19942
|
| Schriftenreihe: | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series
288 |
| Schlagworte: | |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010479475 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951116s1994 |||| 00||| engod | ||
| 035 | |a (OCoLC)223112901 | ||
| 035 | |a (DE-599)BVBBV010479475 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Hirshfeld, Yoram |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes |c Yoram Hirshfeld, Mark Jerrum and Faron Moller |
| 264 | 1 | |a Edinburgh |c 19942 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 288 | |
| 650 | 4 | |a Computers | |
| 700 | 1 | |a Jerrum, Mark |d 1955- |e Verfasser |0 (DE-588)12443133X |4 aut | |
| 700 | 1 | |a Moller, Faron |e Verfasser |4 aut | |
| 830 | 0 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 288 |w (DE-604)BV008930032 |9 288 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006982968 | ||
Datensatz im Suchindex
| _version_ | 1804124912396271616 |
|---|---|
| any_adam_object | |
| author | Hirshfeld, Yoram Jerrum, Mark 1955- Moller, Faron |
| author_GND | (DE-588)12443133X |
| author_facet | Hirshfeld, Yoram Jerrum, Mark 1955- Moller, Faron |
| author_role | aut aut aut |
| author_sort | Hirshfeld, Yoram |
| author_variant | y h yh m j mj f m fm |
| building | Verbundindex |
| bvnumber | BV010479475 |
| ctrlnum | (OCoLC)223112901 (DE-599)BVBBV010479475 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01078nam a2200289 cb4500</leader><controlfield tag="001">BV010479475</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951116s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)223112901</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010479475</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hirshfeld, Yoram</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes</subfield><subfield code="c">Yoram Hirshfeld, Mark Jerrum and Faron Moller</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">19942</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series</subfield><subfield code="v">288</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jerrum, Mark</subfield><subfield code="d">1955-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12443133X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moller, Faron</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series</subfield><subfield code="v">288</subfield><subfield code="w">(DE-604)BV008930032</subfield><subfield code="9">288</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006982968</subfield></datafield></record></collection> |
| id | DE-604.BV010479475 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:53:12Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006982968 |
| oclc_num | 223112901 |
| open_access_boolean | |
| physical | 12 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |
| series2 | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |
| spelling | Hirshfeld, Yoram Verfasser aut A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes Yoram Hirshfeld, Mark Jerrum and Faron Moller Edinburgh 19942 12 S. txt rdacontent n rdamedia nc rdacarrier Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 288 Computers Jerrum, Mark 1955- Verfasser (DE-588)12443133X aut Moller, Faron Verfasser aut Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 288 (DE-604)BV008930032 288 |
| spellingShingle | Hirshfeld, Yoram Jerrum, Mark 1955- Moller, Faron A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series Computers |
| title | A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes |
| title_auth | A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes |
| title_exact_search | A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes |
| title_full | A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes Yoram Hirshfeld, Mark Jerrum and Faron Moller |
| title_fullStr | A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes Yoram Hirshfeld, Mark Jerrum and Faron Moller |
| title_full_unstemmed | A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes Yoram Hirshfeld, Mark Jerrum and Faron Moller |
| title_short | A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes |
| title_sort | a polynomial time algorithm for deciding bisimulation equivalence of normed basic parallel processes |
| topic | Computers |
| topic_facet | Computers |
| volume_link | (DE-604)BV008930032 |
| work_keys_str_mv | AT hirshfeldyoram apolynomialtimealgorithmfordecidingbisimulationequivalenceofnormedbasicparallelprocesses AT jerrummark apolynomialtimealgorithmfordecidingbisimulationequivalenceofnormedbasicparallelprocesses AT mollerfaron apolynomialtimealgorithmfordecidingbisimulationequivalenceofnormedbasicparallelprocesses |