The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
An extensional treatment of lazy data flow deadlock
Selected papers of the workshop on Topology and completion in semantics
YAPI: application modeling for signal processing systems
Proceedings of the 37th Annual Design Automation Conference
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
An extensible type system for component-based design
An extensible type system for component-based design
A behavioral type system and its application in Ptolemy II
Formal Aspects of Computing
A framework for comparing models of computation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Separate compilation for synchronous programs
Proceedings of th 12th International Workshop on Software and Compilers for Embedded Systems
Coordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Feasibility of semiring-based timing constraints
ACM Transactions on Embedded Computing Systems (TECS)
MBEERTS'07 Proceedings of the 2007 International Dagstuhl conference on Model-based engineering of embedded real-time systems
Hi-index | 0.00 |
In this paper, we consider a concurrent model of computation called dataflow, where components (actors) communicate via streams of data tokens. Dataflow semantics has been adopted by experimental and production languages used to design embedded systems. The execution of a dataflow actor is enabled by the availability of its input data. One important question is whether a dataflow model will deadlock (i.e., actors cannot execute due to a data dependency loop). Deadlock in many cases can be determined, although it is generally not decidable. We develop a causality interface for dataflow actors based on the general framework we introduced in [1]and show how this causality information can be algebraically composed so that composition of components acquire causality interfaces that are inferred from their components and the interconnections. We illustrate the use of these causality interfaces to statically analyze for deadlock.