On the public citation graph

String execution time for finite languages: Max is easy, min is hard

https://doi.org/10.1016/j.automatica.2011.06.024

0 signed · 40 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/s10626-009-0083-6openalex-snapshot

Supervisory Control of (max,+) Automata: A Behavioral Approach

inferredcites →https://doi.org/10.1016/1385-7258(77)90055-5openalex-snapshot

Contentment in graph theory: Covering graphs with cliques

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.1017/cbo9780511662508.009openalex-snapshot

Task resource models and (max, +) automata

inferredcites →https://doi.org/10.1109/9.478227openalex-snapshot

Performance evaluation of (max,+) automata

inferredcites →https://doi.org/10.1109/tac.2011.2157391openalex-snapshot

The Synthesis of Time Optimal Supervisors by Using Heaps-of-Pieces

inferredcites →https://doi.org/10.1109/wodes.2008.4605922openalex-snapshot

Control of (max,+) automata: Logical and timing aspects

inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb16436.xopenalex-snapshot

Heaps of Pieces, I: Basic Definitions and Combinatorial Lemmas

inferredcites →https://doi.org/10.1137/0325013openalex-snapshot

Supervisory Control of a Class of Discrete Event Processes

inferredcites →https://doi.org/10.1137/0325036openalex-snapshot

On the Supremal Controllable Sublanguage of a Given Language

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-73102-5_7openalex-snapshot

Performance Evaluation of Discrete-Event Systems

inferred← citeshttps://doi.org/10.1007/s10626-013-0178-yopenalex-snapshot

New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems

inferred← citeshttps://doi.org/10.1007/s10626-014-0195-5openalex-snapshot

Model approximation for batch flow shop scheduling with fixed batch sizes

inferred← citeshttps://doi.org/10.1007/s10626-019-00294-wopenalex-snapshot

Analysis and control of max-plus linear discrete-event systems: An introduction

inferred← citeshttps://doi.org/10.1007/s10626-026-00441-0openalex-snapshot

Weakly strong semantics of Time Petri Nets and its algebraic description

inferred← citeshttps://doi.org/10.1016/j.asoc.2016.07.029openalex-snapshot

Optimizing urban traffic light scheduling problem using harmony search with ensemble of local search

inferred← citeshttps://doi.org/10.1016/j.automatica.2017.01.003openalex-snapshot

Control protocol synthesis for multi-agent systems with similar actions instantiated from agent and requirement templates

inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.393openalex-snapshot

An Application of Incremental Scheduling to a Cluster Photolithography Tool

inferred← citeshttps://doi.org/10.1016/j.ifacol.2022.10.320openalex-snapshot

Fault tolerance makespan synthesis in multi-process systems via resource sharing and backtracking

inferred← citeshttps://doi.org/10.1016/j.ifacol.2024.07.012openalex-snapshot

Weakly strong semantics of Time Petri Nets for performance evaluations

inferred← citeshttps://doi.org/10.1016/j.swevo.2017.05.002openalex-snapshot

Jaya, harmony search and water cycle algorithms for solving large-scale real-life urban traffic light scheduling problem

inferred← citeshttps://doi.org/10.1109/acc.2013.6579951openalex-snapshot

Coordinated distributed time optimal supervisory control

inferred← citeshttps://doi.org/10.1109/acc.2015.7170768openalex-snapshot

Computation of the maximum time for failure diagnosis of discrete-event systems

inferred← citeshttps://doi.org/10.1109/ccta.2017.8062682openalex-snapshot

Modelling and traffic signal control of a heterogeneous traffic network with signalized and non-signalized intersections

inferred← citeshttps://doi.org/10.1109/ccta.2017.8062684openalex-snapshot

Traffic light scheduling for pedestrians and vehicles

inferred← citeshttps://doi.org/10.1109/cdc.2012.6426912openalex-snapshot

A greedy algorithm for computing finite-makespan controllable sublanguages

inferred← citeshttps://doi.org/10.1109/cdc.2017.8264605openalex-snapshot

A hierarchical approach for air traffic routing and scheduling

inferred← citeshttps://doi.org/10.1109/cdc.2017.8264607openalex-snapshot

A macroscopic propagation model for bidirectional pedestrian flows on signalized crosswalks

inferred← citeshttps://doi.org/10.1109/coase.2017.8256222openalex-snapshot

Time optimal synthesis based upon sequential abstraction and maximizing parallelism

inferred← citeshttps://doi.org/10.1109/icarcv.2014.7064299openalex-snapshot

Discrete-event based vehicle dispatching and scheduling in multicommodity transportations

inferred← citeshttps://doi.org/10.1109/tac.2014.2342099openalex-snapshot

A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages

inferred← citeshttps://doi.org/10.1109/tac.2021.3053228openalex-snapshot

Abstraction of the Supervisory Control Solution to Deal With Planning Problems in Manufacturing Systems

inferred← citeshttps://doi.org/10.1109/tase.2016.2613911openalex-snapshot

Time Optimal Synthesis Based Upon Sequential Abstraction and Its Application to Cluster Tools

inferred← citeshttps://doi.org/10.1109/wodes.2016.7497840openalex-snapshot

Incremental scheduling of discrete event systems

inferred← citeshttps://doi.org/10.1137/140991285openalex-snapshot

A Weighted Pair Graph Representation for Reconstructibility of Boolean Control Networks

inferred← citeshttps://doi.org/10.3182/20121003-3-mx-4033.00022openalex-snapshot

New representations for (max,+) automata with applications to the performance evaluation of discrete event systems

inferred← citeshttps://doi.org/10.3182/20121003-3-mx-4033.00024openalex-snapshot

Abstraction-based Synthesis of Timed Supervisors for Time-Weighted Systems

inferred← citeshttps://doi.org/10.3182/20140514-3-fr-4046.00091openalex-snapshot

Modeling of timed Petri nets using deterministic (max,+) automata

inferred← citeshttps://doi.org/10.5220/0004038905050510openalex-snapshot

Performance Evaluation of Discrete Event Systems Thanks to New Representations for (max,+) Automata

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.