Concurrent timed port automata:
Abstract: "We present a new and powerful class of automata which are explicitly concurrent and allow a very simple definition of composition. The novelty of these automata is their time-synchronous message-asynchronous communication mechanism. Time synchrony is obtained by using a global clock....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | German |
| Published: |
München
1995
|
| Series: | Technische Universität <München>: TUM-I
9533 |
| Subjects: | |
| Summary: | Abstract: "We present a new and powerful class of automata which are explicitly concurrent and allow a very simple definition of composition. The novelty of these automata is their time-synchronous message-asynchronous communication mechanism. Time synchrony is obtained by using a global clock. Message asynchrony is obtained by requiring the automata to react to every input. Explicit concurrency is obtained by marking each transition with a set of input and output messages. We compare these automata with a history based approach which uses the same communication mechanism and show that they are equivalent." |
| Physical Description: | 29 S. graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010841148 | ||
| 003 | DE-604 | ||
| 005 | 20040416 | ||
| 007 | t | ||
| 008 | 960701s1995 gw d||| t||| 00||| ger d | ||
| 016 | 7 | |a 94779896X |2 DE-101 | |
| 035 | |a (OCoLC)35746887 | ||
| 035 | |a (DE-599)BVBBV010841148 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 |a DE-91G | ||
| 088 | |a TUM I 9533 | ||
| 100 | 1 | |a Grosu, Radu |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Concurrent timed port automata |c Radu Grosu ; Bernhard Rumpe |
| 264 | 1 | |a München |c 1995 | |
| 300 | |a 29 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM-I |v 9533 | |
| 520 | 3 | |a Abstract: "We present a new and powerful class of automata which are explicitly concurrent and allow a very simple definition of composition. The novelty of these automata is their time-synchronous message-asynchronous communication mechanism. Time synchrony is obtained by using a global clock. Message asynchrony is obtained by requiring the automata to react to every input. Explicit concurrency is obtained by marking each transition with a set of input and output messages. We compare these automata with a history based approach which uses the same communication mechanism and show that they are equivalent." | |
| 650 | 4 | |a Data flow computing | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Machine theory | |
| 700 | 1 | |a Rumpe, Bernhard |d 1967- |e Verfasser |0 (DE-588)113726414 |4 aut | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9533 |w (DE-604)BV006185376 |9 9533 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007246840 | ||
Record in the Search Index
| _version_ | 1804125328847667200 |
|---|---|
| any_adam_object | |
| author | Grosu, Radu Rumpe, Bernhard 1967- |
| author_GND | (DE-588)113726414 |
| author_facet | Grosu, Radu Rumpe, Bernhard 1967- |
| author_role | aut aut |
| author_sort | Grosu, Radu |
| author_variant | r g rg b r br |
| building | Verbundindex |
| bvnumber | BV010841148 |
| ctrlnum | (OCoLC)35746887 (DE-599)BVBBV010841148 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01715nam a2200361 cb4500</leader><controlfield tag="001">BV010841148</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040416 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960701s1995 gw d||| t||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">94779896X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35746887</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010841148</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM I 9533</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Grosu, Radu</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Concurrent timed port automata</subfield><subfield code="c">Radu Grosu ; Bernhard Rumpe</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">29 S.</subfield><subfield code="b">graph. Darst.</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">Technische Universität <München>: TUM-I</subfield><subfield code="v">9533</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a new and powerful class of automata which are explicitly concurrent and allow a very simple definition of composition. The novelty of these automata is their time-synchronous message-asynchronous communication mechanism. Time synchrony is obtained by using a global clock. Message asynchrony is obtained by requiring the automata to react to every input. Explicit concurrency is obtained by marking each transition with a set of input and output messages. We compare these automata with a history based approach which uses the same communication mechanism and show that they are equivalent."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data flow computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rumpe, Bernhard</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)113726414</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9533</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9533</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007246840</subfield></datafield></record></collection> |
| id | DE-604.BV010841148 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:59:49Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007246840 |
| oclc_num | 35746887 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-12 DE-91G DE-BY-TUM |
| physical | 29 S. graph. Darst. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Technische Universität <München>: TUM-I |
| spelling | Grosu, Radu Verfasser aut Concurrent timed port automata Radu Grosu ; Bernhard Rumpe München 1995 29 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9533 Abstract: "We present a new and powerful class of automata which are explicitly concurrent and allow a very simple definition of composition. The novelty of these automata is their time-synchronous message-asynchronous communication mechanism. Time synchrony is obtained by using a global clock. Message asynchrony is obtained by requiring the automata to react to every input. Explicit concurrency is obtained by marking each transition with a set of input and output messages. We compare these automata with a history based approach which uses the same communication mechanism and show that they are equivalent." Data flow computing Data structures (Computer science) Machine theory Rumpe, Bernhard 1967- Verfasser (DE-588)113726414 aut Technische Universität <München>: TUM-I 9533 (DE-604)BV006185376 9533 |
| spellingShingle | Grosu, Radu Rumpe, Bernhard 1967- Concurrent timed port automata Technische Universität <München>: TUM-I Data flow computing Data structures (Computer science) Machine theory |
| title | Concurrent timed port automata |
| title_auth | Concurrent timed port automata |
| title_exact_search | Concurrent timed port automata |
| title_full | Concurrent timed port automata Radu Grosu ; Bernhard Rumpe |
| title_fullStr | Concurrent timed port automata Radu Grosu ; Bernhard Rumpe |
| title_full_unstemmed | Concurrent timed port automata Radu Grosu ; Bernhard Rumpe |
| title_short | Concurrent timed port automata |
| title_sort | concurrent timed port automata |
| topic | Data flow computing Data structures (Computer science) Machine theory |
| topic_facet | Data flow computing Data structures (Computer science) Machine theory |
| volume_link | (DE-604)BV006185376 |
| work_keys_str_mv | AT grosuradu concurrenttimedportautomata AT rumpebernhard concurrenttimedportautomata |