On the public citation graph
Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs
0 signed · 52 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230210206openalex-snapshot
Faster parametric shortest path and minimum‐balance algorithms
inferredcites →https://doi.org/10.1007/bf02107055openalex-snapshot
Determining the minimum iteration period of an algorithm
inferredcites →https://doi.org/10.1016/0166-218x(94)90156-2openalex-snapshot
Synchronization and Linearity
inferredcites →https://doi.org/10.1016/s1367-5788(99)00023-1openalex-snapshot
Max-plus algebra and system theory: where we are and where to go now
inferredcites →https://doi.org/10.1016/s1367-5788(99)90091-3openalex-snapshot
Max-plus algebra and system theory: Where we are and where to go now
inferredcites →https://doi.org/10.1016/s1474-6670(17)42067-2openalex-snapshot
Numerical Computation of Spectral Elements in Max-Plus Algebra ☆
inferredcites →https://doi.org/10.1109/acsd.2006.33openalex-snapshot
Throughput Analysis of Synchronous Data Flow Graphs
inferredcites →https://doi.org/10.1109/etfa.1999.813105openalex-snapshot
Cycle time computation in deterministically timed weighted marked graphs
inferredcites →https://doi.org/10.1109/fmcad.2006.20openalex-snapshot
Liveness and Boundedness of Synchronous Data Flow Graphs
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/1629911.1630146openalex-snapshot
Reduction techniques for synchronous dataflow graphs
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-319-66284-8_39openalex-snapshot
Towards Component-Based (max,+) Algebraic Throughput Analysis of Hierarchical Synchronous Data Flow 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/s00224-024-10191-xopenalex-snapshot
Max-plus Algebraic Description of Evolutions of Weighted Timed Event Graphs
inferred← citeshttps://doi.org/10.1007/s10626-023-00382-yopenalex-snapshot
Modeling and analysis of switching max-plus linear systems with discrete-event feedback
inferred← citeshttps://doi.org/10.1007/s11265-021-01649-zopenalex-snapshot
Evaluation of the Exact Throughput of a Synchronous DataFlow Graph
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2014.08.015openalex-snapshot
Mapping streaming applications on multiprocessors with time-division-multiplexed network-on-chip
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.1109/access.2020.3013013openalex-snapshot
Latency Evaluation of SDFGs on Heterogeneous Processors Using Timed Automata
inferred← citeshttps://doi.org/10.1109/acsd.2014.13openalex-snapshot
Resource-Constrained Optimal Scheduling of Synchronous Dataflow Graphs via Timed Automata
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/estimedia.2013.6704509openalex-snapshot
Periodic schedules for Cyclo-Static Dataflow
inferred← citeshttps://doi.org/10.1109/fdl63219.2024.10673877openalex-snapshot
Multi-objective preference-free exact design space exploration of static DSP on multicore platforms
inferred← citeshttps://doi.org/10.1109/fpl.2015.7293946openalex-snapshot
Energy optimization of FPGA-based stream-oriented computing with power gating
inferred← citeshttps://doi.org/10.1109/iscas.2017.8050774openalex-snapshot
Throughput evaluation of DSP applications based on hierarchical dataflow models
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.2017.8344630openalex-snapshot
Relaxed subgraph execution model for the throughput evaluation of IBSDF graphs
inferred← citeshttps://doi.org/10.1109/tac.2013.2294822openalex-snapshot
Modeling and Control of Weight-Balanced Timed Event Graphs in Dioids
inferred← citeshttps://doi.org/10.1109/tase.2017.2729894openalex-snapshot
Weight-Balanced Timed Event Graphs to Model Periodic Phenomena in Manufacturing Systems
inferred← citeshttps://doi.org/10.1109/tcad.2023.3239538openalex-snapshot
Efficient Computation of the Max-Plus Semantics of Synchronous Dataflow Graphs
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/3023973.3023977openalex-snapshot
Throughput Propagation in Constraint-Based Design Space Exploration for Mixed-Criticality Systems
inferred← citeshttps://doi.org/10.1145/3323439.3323979openalex-snapshot
On the Analytic Evaluation of Schedules via Max-Plus Algebra for DSE of Multi-Core Architectures
inferred← citeshttps://doi.org/10.1145/3426194openalex-snapshot
Taming the State-space Explosion in the Makespan Optimization of Flexible Manufacturing Systems
inferred← citeshttps://doi.org/10.1145/3615586openalex-snapshot
Real-time Fixed Priority Scheduling Synthesis Using Affine DataFlow Graphs: from Theory to Practice
inferred← citeshttps://doi.org/10.23919/date.2017.7927116openalex-snapshot
Latency analysis of homogeneous synchronous dataflow graphs using timed automata
inferred← citeshttps://doi.org/10.23919/date69613.2026.11539744openalex-snapshot
Efficient Throughput Analysis of Synchronous Dataflow Graphs via Parametric Shortest Path
inferred← citeshttps://doi.org/10.6100/ir780952openalex-snapshot
Worst-case temporal analysis of real-time dynamic streaming applications
inferred← citeshttps://doi.org/10.70675/2a3b61eaz6bccz40abza383z30466768ef68openalex-snapshot
Modélisation et Évaluation Analytique du Temps de Réponse des Systèmes de Contrôle-Commande Distribués en utilisant des Réseaux de Petri et l'Algèbre des Dioïdes
inferred← citeshttps://doi.org/10.70675/303a90cez867ez4955za152z74c9d1f0e0a5openalex-snapshot
Etude et implantation d'algorithmes pour le placement et l'ordonnancement d'applications Dataflow
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.