Processes as terms: non-well-founded models for bisimulation
Abstract: "A compositional semantics characterizing bisimulation equivalence is derived from transition system specifications in the SOS style, satisfying certain syntactic conditions. We use Aczel's nonstandard set theory for solving a recursive equation for a domain of processes. It cont...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1992
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,11 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "A compositional semantics characterizing bisimulation equivalence is derived from transition system specifications in the SOS style, satisfying certain syntactic conditions. We use Aczel's nonstandard set theory for solving a recursive equation for a domain of processes. It contains non-well-founded elements modelling possibly infinite behavior. Semantic interpretations of syntactic operators are obtained by defining the operational semantics for terms consisting of both syntactic and semantic (processes) entities. Finally we return to standard set theory by observing that a similar though less general result can be obtained with the use of complete metric spaces." |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008745 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28083153 | ||
| 035 | |a (DE-599)BVBBV009008745 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Rutten, J. J. M. M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Processes as terms |b non-well-founded models for bisimulation |c J. J. M. M. Rutten |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 19 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 92,11 | |
| 520 | 3 | |a Abstract: "A compositional semantics characterizing bisimulation equivalence is derived from transition system specifications in the SOS style, satisfying certain syntactic conditions. We use Aczel's nonstandard set theory for solving a recursive equation for a domain of processes. It contains non-well-founded elements modelling possibly infinite behavior. Semantic interpretations of syntactic operators are obtained by defining the operational semantics for terms consisting of both syntactic and semantic (processes) entities. Finally we return to standard set theory by observing that a similar though less general result can be obtained with the use of complete metric spaces." | |
| 650 | 4 | |a Semantics | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,11 |w (DE-604)BV008928356 |9 92,11 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005955232 | ||
Datensatz im Suchindex
| _version_ | 1804123355879571456 |
|---|---|
| any_adam_object | |
| author | Rutten, J. J. M. M. |
| author_facet | Rutten, J. J. M. M. |
| author_role | aut |
| author_sort | Rutten, J. J. M. M. |
| author_variant | j j m m r jjmm jjmmr |
| building | Verbundindex |
| bvnumber | BV009008745 |
| ctrlnum | (OCoLC)28083153 (DE-599)BVBBV009008745 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01648nam a2200289 cb4500</leader><controlfield tag="001">BV009008745</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28083153</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008745</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">Rutten, J. J. M. M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Processes as terms</subfield><subfield code="b">non-well-founded models for bisimulation</subfield><subfield code="c">J. J. M. M. Rutten</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">92,11</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A compositional semantics characterizing bisimulation equivalence is derived from transition system specifications in the SOS style, satisfying certain syntactic conditions. We use Aczel's nonstandard set theory for solving a recursive equation for a domain of processes. It contains non-well-founded elements modelling possibly infinite behavior. Semantic interpretations of syntactic operators are obtained by defining the operational semantics for terms consisting of both syntactic and semantic (processes) entities. Finally we return to standard set theory by observing that a similar though less general result can be obtained with the use of complete metric spaces."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Semantics</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">92,11</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,11</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955232</subfield></datafield></record></collection> |
| id | DE-604.BV009008745 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955232 |
| oclc_num | 28083153 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 19 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Rutten, J. J. M. M. Verfasser aut Processes as terms non-well-founded models for bisimulation J. J. M. M. Rutten Amsterdam 1992 19 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,11 Abstract: "A compositional semantics characterizing bisimulation equivalence is derived from transition system specifications in the SOS style, satisfying certain syntactic conditions. We use Aczel's nonstandard set theory for solving a recursive equation for a domain of processes. It contains non-well-founded elements modelling possibly infinite behavior. Semantic interpretations of syntactic operators are obtained by defining the operational semantics for terms consisting of both syntactic and semantic (processes) entities. Finally we return to standard set theory by observing that a similar though less general result can be obtained with the use of complete metric spaces." Semantics Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,11 (DE-604)BV008928356 92,11 |
| spellingShingle | Rutten, J. J. M. M. Processes as terms non-well-founded models for bisimulation Semantics |
| title | Processes as terms non-well-founded models for bisimulation |
| title_auth | Processes as terms non-well-founded models for bisimulation |
| title_exact_search | Processes as terms non-well-founded models for bisimulation |
| title_full | Processes as terms non-well-founded models for bisimulation J. J. M. M. Rutten |
| title_fullStr | Processes as terms non-well-founded models for bisimulation J. J. M. M. Rutten |
| title_full_unstemmed | Processes as terms non-well-founded models for bisimulation J. J. M. M. Rutten |
| title_short | Processes as terms |
| title_sort | processes as terms non well founded models for bisimulation |
| title_sub | non-well-founded models for bisimulation |
| topic | Semantics |
| topic_facet | Semantics |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT ruttenjjmm processesastermsnonwellfoundedmodelsforbisimulation |