On the public citation graph

Liveness and Boundedness of Synchronous Data Flow Graphs

0 signed · 60 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-55676-1_20openalex-snapshot
On weighted T-systems
inferredcites →https://doi.org/10.1007/3-540-65306-6_20openalex-snapshot
Decidability and complexity of Petri net problems — An introduction
inferredcites →https://doi.org/10.1007/bf02837777openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1016/0304-3975(77)90014-7openalex-snapshot
Complexity of some problems in Petri nets
inferredcites →https://doi.org/10.1016/s0895-7177(00)00072-8openalex-snapshot
A brief survey and synthesis of the roles of time in petri nets
inferredcites →https://doi.org/10.1023/a:1008052406396openalex-snapshot
Synthesis of Embedded Software from Synchronous Dataflow Specifications
inferredcites →https://doi.org/10.1057/jors.1994.15openalex-snapshot
Synchronization and Linearity: An Algebra for Discrete Event Systems
inferredcites →https://doi.org/10.1109/32.75415openalex-snapshot
Modeling and verification of time dependent systems using time Petri nets
inferredcites →https://doi.org/10.1109/5.24143openalex-snapshot
Petri nets: Properties, analysis and applications
inferredcites →https://doi.org/10.1109/acsd.2006.33openalex-snapshot
Throughput Analysis of Synchronous Data Flow Graphs
inferredcites →https://doi.org/10.1109/proc.1987.13876openalex-snapshot
Synchronous data flow
inferredcites →https://doi.org/10.1137/0114108openalex-snapshot
Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
inferredcites →https://doi.org/10.1145/1027084.1027085openalex-snapshot
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
inferredcites →https://doi.org/10.1145/951710.951721openalex-snapshot
Task-level timing models for guaranteed performance in multiprocessor networks-on-chip

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_24openalex-snapshot
Local Consistency Check in Synchronous Dataflow Models
inferred← citeshttps://doi.org/10.1007/978-3-319-91734-4_21openalex-snapshot
Throughput analysis of dataflow graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-95246-8_16openalex-snapshot
If We Could Go Back in Time... On the Use of ‘Unnatural’ Time and Ordering in Dataflow Models
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_10openalex-snapshot
Applying Step Coverability Trees to Communicating Component-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40576-1_10openalex-snapshot
Exploiting Functional Models to Assess the Security Aspect in Embedded System Design
inferred← citeshttps://doi.org/10.1016/j.artint.2013.09.006openalex-snapshot
CROSS cyclic resource-constrained scheduling solver
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100678openalex-snapshot
Formal verification of timed synchronous dataflow graphs using Lustre
inferred← citeshttps://doi.org/10.1016/j.scico.2010.11.003openalex-snapshot
Step coverability algorithms for communicating systems
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.7.1748openalex-snapshot
Decomposition of Task-Level Concurrency on C Programs Applied to the Design of Multiprocessor SoC
inferred← citeshttps://doi.org/10.1109/acsd.2014.24openalex-snapshot
Multi-rate Equivalents of Cyclo-Static Synchronous Dataflow Graphs
inferred← citeshttps://doi.org/10.1109/date.2008.4484672openalex-snapshot
Parametric Throughput Analysis of Synchronous Data Flow Graphs
inferred← citeshttps://doi.org/10.1109/date.2012.6176552openalex-snapshot
Model checking of Scenario-Aware Dataflow with CADP
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.25openalex-snapshot
Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow
inferred← citeshttps://doi.org/10.1109/iintec48298.2019.9112116openalex-snapshot
DAG Graph for IoT performance evaluation: Task Partitioning and Co-design Methodology
inferred← citeshttps://doi.org/10.1109/pdp.2014.98openalex-snapshot
Reducing the Communication of Message-Passing Systems Synthesized from Synchronous Programs
inferred← citeshttps://doi.org/10.1109/rtcsa50079.2020.9203667openalex-snapshot
Cyclic Scheduling of Loop-Intensive Applications on Heterogeneous Multiprocessor Architectures
inferred← citeshttps://doi.org/10.1109/samos.2011.6045491openalex-snapshot
Scenario-aware dataflow: Modeling, analysis and implementation of dynamic applications
inferred← citeshttps://doi.org/10.1109/sbac-padw69789.2025.00012openalex-snapshot
From Static to Quasi-Dynamic: Reconsidering Scheduling and Memory in SDF Compilers
inferred← citeshttps://doi.org/10.1109/seaa.2012.20openalex-snapshot
Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs
inferred← citeshttps://doi.org/10.1109/tc.2008.58openalex-snapshot
Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs
inferred← citeshttps://doi.org/10.1109/tc.2009.155openalex-snapshot
Buffer Sizing for Rate-Optimal Single-Rate Data-Flow Scheduling Revisited
inferred← citeshttps://doi.org/10.1145/1403375.1403407openalex-snapshot
Parametric throughput analysis of synchronous data flow graphs
inferred← citeshttps://doi.org/10.1145/1880050.1880052openalex-snapshot
Synchronous dataflow scenarios
inferred← citeshttps://doi.org/10.1145/2180887.2180888openalex-snapshot
Performance Analysis of Reconfigurations in Adaptive Real-Time Streaming Applications
inferred← citeshttps://doi.org/10.1145/2380445.2380517openalex-snapshot
Worst-case throughput analysis of real-time dynamic streaming applications
inferred← citeshttps://doi.org/10.1145/2463209.2488736openalex-snapshot
Liveness evaluation of a cyclo-static DataFlow graph
inferred← citeshttps://doi.org/10.1145/2609248.2609249openalex-snapshot
Single-rate approximations of cyclo-static synchronous dataflow graphs
inferred← citeshttps://doi.org/10.1145/2792981openalex-snapshot
Incremental Analysis of Cyclo-Static Synchronous Dataflow Graphs
inferred← citeshttps://doi.org/10.1145/2897937.2898056openalex-snapshot
Optimal and fast throughput evaluation of CSDF
inferred← citeshttps://doi.org/10.1145/2910583openalex-snapshot
A New Compilation Flow for Software-Defined Radio Applications on Heterogeneous MPSoCs
inferred← citeshttps://doi.org/10.1145/2956232openalex-snapshot
Reducing the Complexity of Dataflow Graphs Using Slack-Based Merging
inferred← citeshttps://doi.org/10.1145/3229631.3229645openalex-snapshot
Delays and states in dataflow models of computation
inferred← citeshttps://doi.org/10.1145/3559760openalex-snapshot
K-Periodic Scheduling for Throughput-Buffering Trade-Off Exploration of CSDF
inferred← citeshttps://doi.org/10.1145/3635032openalex-snapshot
Design Flow for Scheduling Spiking Deep Convolutional Neural Networks on Heterogeneous Neuromorphic System-on-chip
inferred← citeshttps://doi.org/10.11606/t.3.2012.tde-26072013-171107openalex-snapshot
Caracterização analítica de carga de trabalho baseada em cenários de aplicações multimídia.
inferred← citeshttps://doi.org/10.1201/b15268-20openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.3990/1.9789036542906openalex-snapshot
Green computing
inferred← citeshttps://doi.org/10.47749/t/unicamp.2022.1254318openalex-snapshot
IaRa
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/5503openalex-snapshot
Constraint based methods for allocation and scheduling of periodic applications
inferred← citeshttps://doi.org/10.6100/ir626979openalex-snapshot
Low power design of block-based video codecs
inferred← citeshttps://doi.org/10.6100/ir635718openalex-snapshot
Timing analysis of synchronous data flow graphs
inferred← citeshttps://doi.org/10.6100/ir780952openalex-snapshot
Worst-case temporal analysis of real-time dynamic streaming applications
inferred← citeshttps://doi.org/10.70675/202a5ce2z626az4b57zb563za2e299a327b2openalex-snapshot
Model Based Granularity Optimization for High-Performance Computing Systems in Astronomy
inferred← citeshttps://doi.org/10.70675/6f1bb95ez3f2fz485fz94f7z7b9e2575e76aopenalex-snapshot
Modeling, Scheduling, Pipelining and Configuration of Synchronous Dataflow Graphs with Throughput Constraints
inferred← citeshttps://doi.org/10.70675/a54daae5z5f73z4642zb7b6z977855f1da8dopenalex-snapshot
Deployment of loop-intensive applications on heterogeneous multiprocessor architectures
inferred← citeshttps://doi.org/10.70675/e2466c92zf159z47e9zbaf5z48ab3afeb45fopenalex-snapshot
Contribution to dynamic reconfiguration in component-based systems : consistency and non-functional properties specification
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.