On the public citation graph
Decompositions of asynchronous systems
0 signed · 55 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.1007/3-540-56287-7_116openalex-snapshot
CCS, locations and asynchronous transition systems
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/bf00709154openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1007/bf03180567openalex-snapshot
Multitraces, hypertraces and partial order semantics
inferredcites →https://doi.org/10.1016/0304-3975(81)90112-2openalex-snapshot
Petri nets, event structures and domains, part I
inferredcites →https://doi.org/10.1016/0304-3975(86)90094-0openalex-snapshot
Mixed product and asynchronous automata
inferredcites →https://doi.org/10.1016/0304-3975(92)90180-nopenalex-snapshot
Elementary transition systems
inferredcites →https://doi.org/10.1016/0304-3975(94)90232-1openalex-snapshot
Asynchronous automata versus asynchronous cellular automata
inferredcites →https://doi.org/10.1016/s0304-3975(96)00219-8openalex-snapshot
The synthesis problem for elementary net systems is NP-complete
inferredcites →https://doi.org/10.1051/ita/1987210200991openalex-snapshot
Notes on finite asynchronous automata
inferredcites →https://doi.org/10.1142/s0129054192000231openalex-snapshot
PETRI NETS AND STEP TRANSITION SYSTEMS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/asjc.1300openalex-snapshot
Cooperative Tasking for Deterministic Specification Automata
inferred← citeshttps://doi.org/10.1007/3-540-44919-1_12openalex-snapshot
Modular System Development with Pullbacks
inferred← citeshttps://doi.org/10.1007/3-540-45541-8_11openalex-snapshot
On Concurrent Realization of Reactive Systems and Their Morphisms
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_17openalex-snapshot
Synthesizing Distributed Transition Systems from Global Specifications
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_16openalex-snapshot
General Morphisms of Petri Nets (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4757-6656-1_2openalex-snapshot
From Global Specifications to Distributed Implementations
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_39openalex-snapshot
Process Decomposition via Synchronization Events and Its Application to Counter-Process Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-40022-6_15openalex-snapshot
Team Automata for CSCW – A Survey –
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_2openalex-snapshot
Synthesis of Distributed Algorithms Using Asynchronous Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_29openalex-snapshot
Realizability of Concurrent Recursive Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-32759-9_33openalex-snapshot
Distribution of Modal Transition Systems
inferred← citeshttps://doi.org/10.1007/s00165-005-0066-9openalex-snapshot
The formal design of distributed controllers with d SL and Spin
inferred← citeshttps://doi.org/10.1007/s10559-012-9411-1openalex-snapshot
Asynchronous trace-matching automata
inferred← citeshttps://doi.org/10.1016/j.automatica.2011.01.078openalex-snapshot
Guaranteed global performance through local coordinations
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80301-9openalex-snapshot
Concurrent Realizations of Reactive Systems
inferred← citeshttps://doi.org/10.1049/cth2.12375openalex-snapshot
Decentralized modular hybrid supervisory control for the formation of unmanned helicopters
inferred← citeshttps://doi.org/10.1080/00207179.2011.631149openalex-snapshot
Fault-tolerant cooperative tasking for multi-agent systems
inferred← citeshttps://doi.org/10.1088/1742-6596/2213/1/012030openalex-snapshot
Synthesis of Asynchronous Control and Synchronization for Multi-Robot System under Finite Horizon Temporal Task
inferred← citeshttps://doi.org/10.1088/1742-6596/2216/1/012061openalex-snapshot
Temporal Logic Control Synthesis for Distributed Multi-Agent Cooperative Tasking
inferred← citeshttps://doi.org/10.1109/acc.2013.6580727openalex-snapshot
A parity-based architecture for decentralized discrete-event control
inferred← citeshttps://doi.org/10.1109/acsd.2005.33openalex-snapshot
Two-Phase Distributed Observation Problems
inferred← citeshttps://doi.org/10.1109/acsd.2005.7openalex-snapshot
Complexity Results for Checking Distributed Implementability
inferred← citeshttps://doi.org/10.1109/acsd.2007.33openalex-snapshot
Synthesis and Control of Asynchronous and Distributed Systems
inferred← citeshttps://doi.org/10.1109/apsec.2015.11openalex-snapshot
Designing Distributed Systems w.r.t. Conformance
inferred← citeshttps://doi.org/10.1109/apsec65559.2024.00059openalex-snapshot
Designing Distributed Systems Using SAT Solvers
inferred← citeshttps://doi.org/10.1109/cases.2013.6662529openalex-snapshot
Global property violation detection and diagnosis for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/cdc.2010.5716943openalex-snapshot
Decomposability of global tasks for multi-agent systems
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798861openalex-snapshot
Finding the weakest link(s): Coalition games for decentralized discrete-event control
inferred← citeshttps://doi.org/10.1109/icca.2018.8444359openalex-snapshot
Modular Cooperative Tasking for Multi-agent Systems
inferred← citeshttps://doi.org/10.1109/ramech.2010.5513167openalex-snapshot
Synchronized task decomposition for two cooperative agents
inferred← citeshttps://doi.org/10.1109/tase.2025.3553498openalex-snapshot
Distributed and Reactive Controller Synthesis for Multi-Agent Systems Under Finite Horizon Temporal Logic Tasks
inferred← citeshttps://doi.org/10.1109/wodes.2008.4605994openalex-snapshot
Asymptotic minimal communication for decentralized discrete-event control
inferred← citeshttps://doi.org/10.1134/s1990478909030053openalex-snapshot
Studying a mathematical model of parallel computation by algebraic topology methods
inferred← citeshttps://doi.org/10.18419/opus-2573openalex-snapshot
Automatic synthesis of distributed transition systems
inferred← citeshttps://doi.org/10.25560/23804openalex-snapshot
Synthesis and distribution of modal transition systems from triggered scenarios
inferred← citeshttps://doi.org/10.3233/fi-2000-43123402openalex-snapshot
Finite Completeness of Categories of Petri Nets
inferred← citeshttps://doi.org/10.48550/arxiv.0911.0231openalex-snapshot
Synchronized Task Decomposition for Cooperative Multi-agent Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1101.2002openalex-snapshot
Cooperative Tasking for Deterministic Specification Automata
inferred← citeshttps://doi.org/10.5555/2555729.2555752openalex-snapshot
Global property violation detection and diagnosis for wireless sensor networks
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.