Abstraction in real time process algebra:
Abstract: "In this paper we extend Real Time Process Algebra by the silent step [tau]. We start by giving the operational semantics and we find a characterizing law of which the soundness and the completeness is proven. By adding the integral construct we can interpret symbolic (untimed) proces...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1991
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,44 |
| Subjects: | |
| Summary: | Abstract: "In this paper we extend Real Time Process Algebra by the silent step [tau]. We start by giving the operational semantics and we find a characterizing law of which the soundness and the completeness is proven. By adding the integral construct we can interpret symbolic (untimed) process terms as timed processes. We investigate the resulting [tau]-equivalence and come to a delay bisimulation with a stronger root condition. Finally we test the applicability of this notion of real time abstraction by proving the PAR protocol (Positive Acknowledgement with Retransmission) correct." |
| Physical Description: | 32 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993656 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27638358 | ||
| 035 | |a (DE-599)BVBBV008993656 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Klusener, A. S. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Abstraction in real time process algebra |c A. S. Klusener |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 32 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 91,44 | |
| 520 | 3 | |a Abstract: "In this paper we extend Real Time Process Algebra by the silent step [tau]. We start by giving the operational semantics and we find a characterizing law of which the soundness and the completeness is proven. By adding the integral construct we can interpret symbolic (untimed) process terms as timed processes. We investigate the resulting [tau]-equivalence and come to a delay bisimulation with a stronger root condition. Finally we test the applicability of this notion of real time abstraction by proving the PAR protocol (Positive Acknowledgement with Retransmission) correct." | |
| 650 | 4 | |a Real-time data processing | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,44 |w (DE-604)BV008928356 |9 91,44 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005942390 | ||
Record in the Search Index
| _version_ | 1804123336214577152 |
|---|---|
| any_adam_object | |
| author | Klusener, A. S. |
| author_facet | Klusener, A. S. |
| author_role | aut |
| author_sort | Klusener, A. S. |
| author_variant | a s k as ask |
| building | Verbundindex |
| bvnumber | BV008993656 |
| ctrlnum | (OCoLC)27638358 (DE-599)BVBBV008993656 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01545nam a2200289 cb4500</leader><controlfield tag="001">BV008993656</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27638358</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993656</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">Klusener, A. S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Abstraction in real time process algebra</subfield><subfield code="c">A. S. Klusener</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">32 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">91,44</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper we extend Real Time Process Algebra by the silent step [tau]. We start by giving the operational semantics and we find a characterizing law of which the soundness and the completeness is proven. By adding the integral construct we can interpret symbolic (untimed) process terms as timed processes. We investigate the resulting [tau]-equivalence and come to a delay bisimulation with a stronger root condition. Finally we test the applicability of this notion of real time abstraction by proving the PAR protocol (Positive Acknowledgement with Retransmission) correct."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Real-time data processing</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">91,44</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,44</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005942390</subfield></datafield></record></collection> |
| id | DE-604.BV008993656 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:09Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005942390 |
| oclc_num | 27638358 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 32 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Klusener, A. S. Verfasser aut Abstraction in real time process algebra A. S. Klusener Amsterdam 1991 32 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,44 Abstract: "In this paper we extend Real Time Process Algebra by the silent step [tau]. We start by giving the operational semantics and we find a characterizing law of which the soundness and the completeness is proven. By adding the integral construct we can interpret symbolic (untimed) process terms as timed processes. We investigate the resulting [tau]-equivalence and come to a delay bisimulation with a stronger root condition. Finally we test the applicability of this notion of real time abstraction by proving the PAR protocol (Positive Acknowledgement with Retransmission) correct." Real-time data processing Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,44 (DE-604)BV008928356 91,44 |
| spellingShingle | Klusener, A. S. Abstraction in real time process algebra Real-time data processing |
| title | Abstraction in real time process algebra |
| title_auth | Abstraction in real time process algebra |
| title_exact_search | Abstraction in real time process algebra |
| title_full | Abstraction in real time process algebra A. S. Klusener |
| title_fullStr | Abstraction in real time process algebra A. S. Klusener |
| title_full_unstemmed | Abstraction in real time process algebra A. S. Klusener |
| title_short | Abstraction in real time process algebra |
| title_sort | abstraction in real time process algebra |
| topic | Real-time data processing |
| topic_facet | Real-time data processing |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT kluseneras abstractioninrealtimeprocessalgebra |