Skip to main navigation Skip to search Skip to main content

Fibrational semantics of dataflow networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Beginning with the category Dom of Scott domains and continuous maps, we introduce a syntax for dataflow networks as "systems of inequalities," and provide an associated operational semantics. We observe that, under this semantics, a system of inequalities determines a two-sided fibration in Dom. This leads to the introduction of a certain class of cartesian arrows of spans as a notion of morphism for systems. The resulting structure Sys, consisting of domains, systems, and morphisms, forms a bicategory that embeds Dom up to equivalence and is suitable as a semantic model for nondeterministic networks. Isomorphism in Sys amounts to a notion of system equivalence "up to deterministic internal computations.

Original languageEnglish
Title of host publicationCONCUR 1998 Concurrency Theory - 9th International Conference, Proceedings
EditorsDavide Sangiorgi, Robert de Simone
PublisherSpringer Verlag
Pages597-612
Number of pages16
ISBN (Print)9783540648963
DOIs
StatePublished - 1998
Event9th International Conference on Concurrency Theory, CONCUR 1998 - Nice, France
Duration: Sep 8 1998Sep 11 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1466
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Concurrency Theory, CONCUR 1998
Country/TerritoryFrance
CityNice
Period09/8/9809/11/98

Fingerprint

Dive into the research topics of 'Fibrational semantics of dataflow networks'. Together they form a unique fingerprint.

Cite this