Modelling concurrency with geometry:
Abstract: "The phenomena of branching time and true or noninterleaving concurrency find their respective homes in automata and schedules. But these two models of computation are formally equivalent via Birkhoff duality, an equivalence we expound on here in turorial detail. So why should these p...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1990
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1342 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The phenomena of branching time and true or noninterleaving concurrency find their respective homes in automata and schedules. But these two models of computation are formally equivalent via Birkhoff duality, an equivalence we expound on here in turorial detail. So why should these phenomena prefer one over the other? We identify dimension as the culprit: 1-dimensional automata are skeletons permitting only interleaving concurrency, whereas true n-fold concurrency resides in transitions of dimension n. The truly concurrent automaton dual to a schedule is not a skeletal distributive lattice but a solid one! We introduce true nondeterminism and define it as monoidal homotopy; from this perspective nondeterminism in ordinary automata arises from forking and joining creating nontrivial homotopy The automaton dual to a poset schedule is simply connected whereas that dual to an event structure schedule need not be, according to monoidal homotopy though not to group homotopy. We conclude with a formal definition of higher dimensional automaton as an n-complex or n-category, whose two essential axioms are associativity of concatenation within dimension and an interchange principle between dimensions. |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008978581 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24511342 | ||
| 035 | |a (DE-599)BVBBV008978581 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Pratt, Vaughan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Modelling concurrency with geometry |c Vaughan Pratt |
| 264 | 1 | |a Stanford, Calif. |c 1990 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 1342 | |
| 520 | 3 | |a Abstract: "The phenomena of branching time and true or noninterleaving concurrency find their respective homes in automata and schedules. But these two models of computation are formally equivalent via Birkhoff duality, an equivalence we expound on here in turorial detail. So why should these phenomena prefer one over the other? We identify dimension as the culprit: 1-dimensional automata are skeletons permitting only interleaving concurrency, whereas true n-fold concurrency resides in transitions of dimension n. The truly concurrent automaton dual to a schedule is not a skeletal distributive lattice but a solid one! We introduce true nondeterminism and define it as monoidal homotopy; from this perspective nondeterminism in ordinary automata arises from forking and joining creating nontrivial homotopy | |
| 520 | 3 | |a The automaton dual to a poset schedule is simply connected whereas that dual to an event structure schedule need not be, according to monoidal homotopy though not to group homotopy. We conclude with a formal definition of higher dimensional automaton as an n-complex or n-category, whose two essential axioms are associativity of concatenation within dimension and an interchange principle between dimensions. | |
| 650 | 4 | |a Branching processes | |
| 650 | 4 | |a Stochastic processes | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1342 |w (DE-604)BV008928280 |9 1342 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005929427 | ||
Datensatz im Suchindex
| _version_ | 1804123317318189056 |
|---|---|
| any_adam_object | |
| author | Pratt, Vaughan |
| author_facet | Pratt, Vaughan |
| author_role | aut |
| author_sort | Pratt, Vaughan |
| author_variant | v p vp |
| building | Verbundindex |
| bvnumber | BV008978581 |
| ctrlnum | (OCoLC)24511342 (DE-599)BVBBV008978581 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02164nam a2200313 cb4500</leader><controlfield tag="001">BV008978581</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24511342</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008978581</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="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pratt, Vaughan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modelling concurrency with geometry</subfield><subfield code="c">Vaughan Pratt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1990</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">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1342</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The phenomena of branching time and true or noninterleaving concurrency find their respective homes in automata and schedules. But these two models of computation are formally equivalent via Birkhoff duality, an equivalence we expound on here in turorial detail. So why should these phenomena prefer one over the other? We identify dimension as the culprit: 1-dimensional automata are skeletons permitting only interleaving concurrency, whereas true n-fold concurrency resides in transitions of dimension n. The truly concurrent automaton dual to a schedule is not a skeletal distributive lattice but a solid one! We introduce true nondeterminism and define it as monoidal homotopy; from this perspective nondeterminism in ordinary automata arises from forking and joining creating nontrivial homotopy</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The automaton dual to a poset schedule is simply connected whereas that dual to an event structure schedule need not be, according to monoidal homotopy though not to group homotopy. We conclude with a formal definition of higher dimensional automaton as an n-complex or n-category, whose two essential axioms are associativity of concatenation within dimension and an interchange principle between dimensions.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branching processes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic processes</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1342</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1342</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005929427</subfield></datafield></record></collection> |
| id | DE-604.BV008978581 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:51Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005929427 |
| oclc_num | 24511342 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 12 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Pratt, Vaughan Verfasser aut Modelling concurrency with geometry Vaughan Pratt Stanford, Calif. 1990 12 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1342 Abstract: "The phenomena of branching time and true or noninterleaving concurrency find their respective homes in automata and schedules. But these two models of computation are formally equivalent via Birkhoff duality, an equivalence we expound on here in turorial detail. So why should these phenomena prefer one over the other? We identify dimension as the culprit: 1-dimensional automata are skeletons permitting only interleaving concurrency, whereas true n-fold concurrency resides in transitions of dimension n. The truly concurrent automaton dual to a schedule is not a skeletal distributive lattice but a solid one! We introduce true nondeterminism and define it as monoidal homotopy; from this perspective nondeterminism in ordinary automata arises from forking and joining creating nontrivial homotopy The automaton dual to a poset schedule is simply connected whereas that dual to an event structure schedule need not be, according to monoidal homotopy though not to group homotopy. We conclude with a formal definition of higher dimensional automaton as an n-complex or n-category, whose two essential axioms are associativity of concatenation within dimension and an interchange principle between dimensions. Branching processes Stochastic processes Computer Science Department: Report STAN-CS Stanford University 1342 (DE-604)BV008928280 1342 |
| spellingShingle | Pratt, Vaughan Modelling concurrency with geometry Branching processes Stochastic processes |
| title | Modelling concurrency with geometry |
| title_auth | Modelling concurrency with geometry |
| title_exact_search | Modelling concurrency with geometry |
| title_full | Modelling concurrency with geometry Vaughan Pratt |
| title_fullStr | Modelling concurrency with geometry Vaughan Pratt |
| title_full_unstemmed | Modelling concurrency with geometry Vaughan Pratt |
| title_short | Modelling concurrency with geometry |
| title_sort | modelling concurrency with geometry |
| topic | Branching processes Stochastic processes |
| topic_facet | Branching processes Stochastic processes |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT prattvaughan modellingconcurrencywithgeometry |