A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
München
SFB 342
1995
|
| Schriftenreihe: | Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht / A]
1995,15 |
| Beschreibung: | 22 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011337502 | ||
| 003 | DE-604 | ||
| 005 | 19970512 | ||
| 007 | t | ||
| 008 | 970512s1995 |||| 00||| und d | ||
| 035 | |a (OCoLC)634533166 | ||
| 035 | |a (DE-599)BVBBV011337502 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91 | ||
| 088 | |a TUM I 9528 | ||
| 100 | 1 | |a Kovalyov, Andrei |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs |c Andrei Kovalyov ; Javier Esparza |
| 246 | 1 | 3 | |a TUM I 9528 |
| 264 | 1 | |a München |b SFB 342 |c 1995 | |
| 300 | |a 22 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht / A] |v 1995,15 | |
| 810 | 2 | |a A] |t Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht |v 1995,15 |w (DE-604)BV004627888 |9 1995,15 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007617085 | ||
Datensatz im Suchindex
| _version_ | 1804125845222064128 |
|---|---|
| any_adam_object | |
| author | Kovalyov, Andrei |
| author_facet | Kovalyov, Andrei |
| author_role | aut |
| author_sort | Kovalyov, Andrei |
| author_variant | a k ak |
| building | Verbundindex |
| bvnumber | BV011337502 |
| ctrlnum | (OCoLC)634533166 (DE-599)BVBBV011337502 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01109nam a2200289 cb4500</leader><controlfield tag="001">BV011337502</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970512 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970512s1995 |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634533166</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011337502</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM I 9528</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kovalyov, Andrei</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs</subfield><subfield code="c">Andrei Kovalyov ; Javier Esparza</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">TUM I 9528</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="b">SFB 342</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 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">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht / A]</subfield><subfield code="v">1995,15</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">A]</subfield><subfield code="t">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht</subfield><subfield code="v">1995,15</subfield><subfield code="w">(DE-604)BV004627888</subfield><subfield code="9">1995,15</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007617085</subfield></datafield></record></collection> |
| id | DE-604.BV011337502 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:08:02Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007617085 |
| oclc_num | 634533166 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 22 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | SFB 342 |
| record_format | marc |
| series2 | Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht / A] |
| spelling | Kovalyov, Andrei Verfasser aut A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs Andrei Kovalyov ; Javier Esparza TUM I 9528 München SFB 342 1995 22 S. txt rdacontent n rdamedia nc rdacarrier Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht / A] 1995,15 A] Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung Paralleler Rechnerarchitekturen <München>: [SFB-Bericht 1995,15 (DE-604)BV004627888 1995,15 |
| spellingShingle | Kovalyov, Andrei A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs |
| title | A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs |
| title_alt | TUM I 9528 |
| title_auth | A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs |
| title_exact_search | A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs |
| title_full | A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs Andrei Kovalyov ; Javier Esparza |
| title_fullStr | A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs Andrei Kovalyov ; Javier Esparza |
| title_full_unstemmed | A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs Andrei Kovalyov ; Javier Esparza |
| title_short | A polynominal algorithm to compute the concurrency relation of free-choice signal transition graphs |
| title_sort | a polynominal algorithm to compute the concurrency relation of free choice signal transition graphs |
| volume_link | (DE-604)BV004627888 |
| work_keys_str_mv | AT kovalyovandrei apolynominalalgorithmtocomputetheconcurrencyrelationoffreechoicesignaltransitiongraphs AT kovalyovandrei tumi9528 |