<  Retour au portail Polytechnique Montréal

On the Scott-continuity of tagged signal processes

Laurent Moss et Guy Bois

Rapport technique (2009)

Document en libre accès dans PolyPublie et chez l'éditeur officiel
[img]
Affichage préliminaire
Libre accès au plein texte de ce document
Version officielle de l'éditeur
Conditions d'utilisation: Tous droits réservés
Télécharger (588kB)
Afficher le résumé
Cacher le résumé

Résumé

Process networks are frequently used to model signal processing and multimedia applications. It is important to ensure that a process network has a uniquely defined behavior in order to correctly model such deterministic systems. Furthermore, a constructive procedure to determine this unique behavior is necessary for its simulation and execution. By the Kahn principle, the unique behavior of a process network is known to be the least fixed point of the network functional when every process computes a Scott-continuous function. The Kahn principle is used in a recent timed extension of the least fixed point semantics of Kahn process networks, using the tagged signal model. In this extension, processes compute a function from input signals to output signals, where a signal is defined as a partial function from a down set of tags to a set of values. However, it is often tedious to formally prove that a tagged signal process is Scott-continuous. This paper presents theorems on Scott-continuity that simplify such proofs. Thus, a general theorem on the necessary and sufficient conditions for the Scott-continuity of tagged signal processes is proven. Scott-continuity is then proven for broad classes of processes, namely the classes of exactly causal processes and of domain-warping processes, which include stateless processes, delays as well as a subset of discrete-event processes.

Mots clés

Process networks, Denotational semantics, Timed systems, Discrete events, Dataflow

Sujet(s): 2700 Technologie de l'information > 2700 Technologie de l'information
2700 Technologie de l'information > 2719 Architecture d'ordinateur et conception
Département: Département de génie informatique et génie logiciel
URL de PolyPublie: https://publications.polymtl.ca/2640/
Numéro du rapport: EPM-RT-2009-01
Date du dépôt: 06 oct. 2017 13:37
Dernière modification: 04 mai 2023 16:14
Citer en APA 7: Moss, L., & Bois, G. (2009). On the Scott-continuity of tagged signal processes. (Rapport technique n° EPM-RT-2009-01). https://publications.polymtl.ca/2640/

Statistiques

Total des téléchargements à partir de PolyPublie

Téléchargements par année

Provenance des téléchargements

Actions réservées au personnel

Afficher document Afficher document