Publikation: Four Issues Concerning the Semantics of Message Flow Graphs
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
We discuss four issues concerning the semantics of Message Flow Graphs (MGFs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence Chart (MSC) is ITU Standard Z.120. We require that a system described by an MFG has global states with respect to its message-pasing behavior, with transitions between these states effected by atomic message-passing actions. Under this assumption, we argue (a) that the collection of global message states defined by an MFG is finite (whether fpr synchronous, asynchronous or partially-asynchronous message-passing); (b) that the unrestricted use of 'conditions' requires processes to keep control history variables of potentially unbounded size; (c) that allowing 'crossing' messages of the same type implies certain properties of the environment that are neither explicit nor desirable, and (d) that liveness properties of MFGs are more easily expressed by temporal logic formulas over the control states than by Büchi acceptance conditions over the same set of states.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
LADKIN, Peter B., Stefan LEUE, 1995. Four Issues Concerning the Semantics of Message Flow Graphs. IFIP WG 6.1. Berne, Switzerland, Okt. 1994. In: DIETER HOGREFE AND STEFAN LEUE, , ed.. Formal description techniques VII : proceedings of the 7 th IFIP WG 6.1 International Conference on Formal Description Techniques [held in Berne, Switzerland, October 1994]. London: Chapman & Hall, 1995, pp. 355-369BibTex
@inproceedings{Ladkin1995Issue-5579, year={1995}, title={Four Issues Concerning the Semantics of Message Flow Graphs}, publisher={Chapman & Hall}, address={London}, booktitle={Formal description techniques VII : proceedings of the 7 th IFIP WG 6.1 International Conference on Formal Description Techniques [held in Berne, Switzerland, October 1994]}, pages={355--369}, editor={Dieter Hogrefe and Stefan Leue}, author={Ladkin, Peter B. and Leue, Stefan} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5579"> <dc:language>eng</dc:language> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/> <dc:creator>Leue, Stefan</dc:creator> <dc:contributor>Ladkin, Peter B.</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:34Z</dc:date> <dc:contributor>Leue, Stefan</dc:contributor> <dcterms:bibliographicCitation>First publ. in: Formal description techniques VII : proceedings of the 7th IFIP WG 6.1 International Conference on Formal Description Techniques, [held in Berne, Switzerland, October 1994] / edited by Dieter Hogrefe and Stefan Leue. London : Chapman & Hall, 1995, pp. 355-369</dcterms:bibliographicCitation> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:title>Four Issues Concerning the Semantics of Message Flow Graphs</dcterms:title> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5579/1/Four_Issues_Concerning_the_Semantics_of_Message_Flow_Graphs.pdf"/> <dcterms:issued>1995</dcterms:issued> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:34Z</dcterms:available> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5579/1/Four_Issues_Concerning_the_Semantics_of_Message_Flow_Graphs.pdf"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5579"/> <dc:creator>Ladkin, Peter B.</dc:creator> <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:abstract xml:lang="eng">We discuss four issues concerning the semantics of Message Flow Graphs (MGFs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence Chart (MSC) is ITU Standard Z.120. We require that a system described by an MFG has global states with respect to its message-pasing behavior, with transitions between these states effected by atomic message-passing actions. Under this assumption, we argue (a) that the collection of global message states defined by an MFG is finite (whether fpr synchronous, asynchronous or partially-asynchronous message-passing); (b) that the unrestricted use of 'conditions' requires processes to keep control history variables of potentially unbounded size; (c) that allowing 'crossing' messages of the same type implies certain properties of the environment that are neither explicit nor desirable, and (d) that liveness properties of MFGs are more easily expressed by temporal logic formulas over the control states than by Büchi acceptance conditions over the same set of states.</dcterms:abstract> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:format>application/pdf</dc:format> </rdf:Description> </rdf:RDF>