Generalizing finiteness conditions of labelled transition systems:
Abstract: "A labelled transition system is provided with some additional structure by endowing the configurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Amsterdam
1993
|
Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,65 |
Schlagworte: | |
Zusammenfassung: | Abstract: "A labelled transition system is provided with some additional structure by endowing the configurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the finiteness conditions finitely branching and image finite to compactly branching and image compact, respectively. Some topological properties of the operational semantic models and the so-called higher order transformations induced by labelled transition systems satisfying one of the finiteness conditions are discussed. These results are generalized for metric labelled transition systems satisfying one of the generalized finiteness conditions The generalized results are shown to be useful for studying semantics of programming languages. For example, a proof principle for relating different semantic models for a given language based on the results is presented. |
Beschreibung: | 25 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010177374 | ||
003 | DE-604 | ||
005 | 19950511 | ||
007 | t | ||
008 | 950511s1993 |||| 00||| engod | ||
035 | |a (OCoLC)31372927 | ||
035 | |a (DE-599)BVBBV010177374 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
100 | 1 | |a Breugel, Franck van |e Verfasser |4 aut | |
245 | 1 | 0 | |a Generalizing finiteness conditions of labelled transition systems |c F. van Breugel |
264 | 1 | |a Amsterdam |c 1993 | |
300 | |a 25 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 93,65 | |
520 | 3 | |a Abstract: "A labelled transition system is provided with some additional structure by endowing the configurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the finiteness conditions finitely branching and image finite to compactly branching and image compact, respectively. Some topological properties of the operational semantic models and the so-called higher order transformations induced by labelled transition systems satisfying one of the finiteness conditions are discussed. These results are generalized for metric labelled transition systems satisfying one of the generalized finiteness conditions | |
520 | 3 | |a The generalized results are shown to be useful for studying semantics of programming languages. For example, a proof principle for relating different semantic models for a given language based on the results is presented. | |
650 | 4 | |a Computer programming | |
650 | 4 | |a Semantics | |
810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,65 |w (DE-604)BV008928356 |9 93,65 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006759917 |
Datensatz im Suchindex
_version_ | 1804124575168987136 |
---|---|
any_adam_object | |
author | Breugel, Franck van |
author_facet | Breugel, Franck van |
author_role | aut |
author_sort | Breugel, Franck van |
author_variant | f v b fv fvb |
building | Verbundindex |
bvnumber | BV010177374 |
ctrlnum | (OCoLC)31372927 (DE-599)BVBBV010177374 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01988nam a2200301 cb4500</leader><controlfield tag="001">BV010177374</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950511 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950511s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31372927</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010177374</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="100" ind1="1" ind2=" "><subfield code="a">Breugel, Franck van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Generalizing finiteness conditions of labelled transition systems</subfield><subfield code="c">F. van Breugel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 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">93,65</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A labelled transition system is provided with some additional structure by endowing the configurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the finiteness conditions finitely branching and image finite to compactly branching and image compact, respectively. Some topological properties of the operational semantic models and the so-called higher order transformations induced by labelled transition systems satisfying one of the finiteness conditions are discussed. These results are generalized for metric labelled transition systems satisfying one of the generalized finiteness conditions</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The generalized results are shown to be useful for studying semantics of programming languages. For example, a proof principle for relating different semantic models for a given language based on the results is presented.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</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">93,65</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,65</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006759917</subfield></datafield></record></collection> |
id | DE-604.BV010177374 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:47:50Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006759917 |
oclc_num | 31372927 |
open_access_boolean | |
physical | 25 S. |
publishDate | 1993 |
publishDateSearch | 1993 |
publishDateSort | 1993 |
record_format | marc |
series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
spelling | Breugel, Franck van Verfasser aut Generalizing finiteness conditions of labelled transition systems F. van Breugel Amsterdam 1993 25 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,65 Abstract: "A labelled transition system is provided with some additional structure by endowing the configurations and the labels with a complete metric. In this way, a so-called metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to generalize the finiteness conditions finitely branching and image finite to compactly branching and image compact, respectively. Some topological properties of the operational semantic models and the so-called higher order transformations induced by labelled transition systems satisfying one of the finiteness conditions are discussed. These results are generalized for metric labelled transition systems satisfying one of the generalized finiteness conditions The generalized results are shown to be useful for studying semantics of programming languages. For example, a proof principle for relating different semantic models for a given language based on the results is presented. Computer programming Semantics Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,65 (DE-604)BV008928356 93,65 |
spellingShingle | Breugel, Franck van Generalizing finiteness conditions of labelled transition systems Computer programming Semantics |
title | Generalizing finiteness conditions of labelled transition systems |
title_auth | Generalizing finiteness conditions of labelled transition systems |
title_exact_search | Generalizing finiteness conditions of labelled transition systems |
title_full | Generalizing finiteness conditions of labelled transition systems F. van Breugel |
title_fullStr | Generalizing finiteness conditions of labelled transition systems F. van Breugel |
title_full_unstemmed | Generalizing finiteness conditions of labelled transition systems F. van Breugel |
title_short | Generalizing finiteness conditions of labelled transition systems |
title_sort | generalizing finiteness conditions of labelled transition systems |
topic | Computer programming Semantics |
topic_facet | Computer programming Semantics |
volume_link | (DE-604)BV008928356 |
work_keys_str_mv | AT breugelfranckvan generalizingfinitenessconditionsoflabelledtransitionsystems |