On the public citation graph
An efficient algorithm for branching bisimulation and stuttering equivalence
0 signed · 170 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1016/0167-6423(90)90071-kopenalex-snapshot
An implementation of an efficient algorithm for bisimulation equivalence
inferredcites →https://doi.org/10.1016/0304-3975(88)90098-9openalex-snapshot
Characterizing finite Kripke structures in propositional temporal logic
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/800221.806724openalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferredcites →https://doi.org/10.1146/annurev.cs.02.060187.001413openalex-snapshot
Research on Automatic Verification of Finite-State Concurrent Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1997.2661openalex-snapshot
Complexity of Equivalence Problems for Concurrent Systems of Finite Agents
inferred← citeshttps://doi.org/10.1007/11575467_6openalex-snapshot
An Abstract Interpretation Perspective on Linear vs. Branching Time
inferred← citeshttps://doi.org/10.1007/11575771_8openalex-snapshot
Enabling Business Process Interoperability Using Contract Workflow Models
inferred← citeshttps://doi.org/10.1007/11812128_21openalex-snapshot
On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
inferred← citeshttps://doi.org/10.1007/11817949_13openalex-snapshot
Operational Determinism and Fast Algorithms
inferred← citeshttps://doi.org/10.1007/11901914_35openalex-snapshot
Sigref – A Symbolic Bisimulation Tool Box
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_17openalex-snapshot
Cones and Foci for Protocol Verification Revisited
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_34openalex-snapshot
State Space Reduction Using Partial τ-Confluence
inferred← citeshttps://doi.org/10.1007/3-540-44919-1_7openalex-snapshot
Deciding Life-Cycle Inheritance on Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_15openalex-snapshot
Abstraction in Probabilistic Process Algebra
inferred← citeshttps://doi.org/10.1007/3-540-46017-9_4openalex-snapshot
Abstraction in Software Model Checking: Principles and Practice
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_15openalex-snapshot
Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_4openalex-snapshot
Compositional Reasoning in Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_9openalex-snapshot
Bisimulation Minimization in an Automata-Theoretic Verification Framework
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_17openalex-snapshot
Action versus state based logics for transition systems
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_126openalex-snapshot
Safety for branching time semantics
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_107openalex-snapshot
Efficient verification of determinate processes
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_78openalex-snapshot
A tool set for deciding behavioral equivalences
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_20openalex-snapshot
Generating BDDs for symbolic model checking in CCS
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_26openalex-snapshot
A semantic driven method to check the fineteness of CCS processes
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_3openalex-snapshot
Computing distinguishing formulas for branching bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_115openalex-snapshot
Checking equivalences between concurrent systems of finite agents (Extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_115openalex-snapshot
Branching bisimulation for context-free processes
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_9openalex-snapshot
Symbolic bisimulation minimisation
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_60openalex-snapshot
Verification and comparison of transition systems
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_37openalex-snapshot
Generating BDD models for process algebra terms
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_47openalex-snapshot
Efficient checking of behavioural relations and modal assertions using fixed-point inversion
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_7openalex-snapshot
Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_3openalex-snapshot
Compositionality in state space verification methods
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_57openalex-snapshot
Polynomial time algorithms for testing probabilistic bisimulation and simulation
inferred← citeshttps://doi.org/10.1007/3-540-61756-6_84openalex-snapshot
Unfold/Fold transformations of concurrent processes
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_14openalex-snapshot
Weak bisimulation for fully probabilistic processes
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_4openalex-snapshot
Leader Election in Anonymous Rings: Franklin Goes Probabilistic
inferred← citeshttps://doi.org/10.1007/978-0-387-35079-0_28openalex-snapshot
Specification and Verification of the PowerScaleTM Bus Arbitration Protocol: An Industrial Experiment with LOTOS
inferred← citeshttps://doi.org/10.1007/978-1-4615-3220-0_2openalex-snapshot
Fault Tolerance as Self-Similarity
inferred← citeshttps://doi.org/10.1007/978-1-4615-3556-0_4openalex-snapshot
On-the-fly Verification of Finite Transition Systems
inferred← citeshttps://doi.org/10.1007/978-1-84628-858-6_23openalex-snapshot
Conformance Test of Federated Choreographies
inferred← citeshttps://doi.org/10.1007/978-3-030-01461-2_7openalex-snapshot
Characterization and Verification of Stuttering Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-030-04618-7_19openalex-snapshot
Computation of Kullback-Leibler Divergence Between Labeled Stochastic Systems with Non-identical State Spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-17465-1_2openalex-snapshot
The mCRL2 Toolset for Analysing Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_26openalex-snapshot
A Framework for Provenance-Preserving History Distribution and Incremental Reduction
inferred← citeshttps://doi.org/10.1007/978-3-030-31175-9_9openalex-snapshot
A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice
inferred← citeshttps://doi.org/10.1007/978-3-030-45237-7_1openalex-snapshot
An O(m log n) algorithm for branching bisimilarity on labelled transition systems
inferred← citeshttps://doi.org/10.1007/978-3-030-57628-8_2openalex-snapshot
On the Semantics of Polychronous Polytimed Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_13openalex-snapshot
Equivalence Checking 40 Years After: A Review of Bisimulation Tools
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_14openalex-snapshot
Apartness and Distinguishing Formulas in Hennessy-Milner Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_19openalex-snapshot
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence: A Simpler Proof
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_6openalex-snapshot
Back-and-Forth in Space: On Logics and Bisimilarity in Closure Spaces
inferred← citeshttps://doi.org/10.1007/978-3-031-35355-0_5openalex-snapshot
Branching Bisimulation Semantics Enables Noninterference Analysis of Reversible Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_8openalex-snapshot
Branching Bisimulation Learning
inferred← citeshttps://doi.org/10.1007/978-3-032-15621-1_6openalex-snapshot
Bounded Model Checking for Calibration of Systems Biology Models Under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-032-22774-4_1openalex-snapshot
Model Checking in Space with Applications to Medical Image Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-07602-7_19openalex-snapshot
Compatibility Checking for Asynchronously Communicating Software
inferred← citeshttps://doi.org/10.1007/978-3-319-11737-9_2openalex-snapshot
Computing Maximal Bisimulations
inferred← citeshttps://doi.org/10.1007/978-3-319-18467-8_6openalex-snapshot
Verifying Observational Determinism
inferred← citeshttps://doi.org/10.1007/978-3-319-39570-8_10openalex-snapshot
Branching Bisimulation Games
inferred← citeshttps://doi.org/10.1007/978-3-319-51966-1_12openalex-snapshot
Three Views of Log Trace Triaging
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_12openalex-snapshot
Logics for Bisimulation and Divergence
inferred← citeshttps://doi.org/10.1007/978-3-319-92997-2_19openalex-snapshot
Trace Comprehension Operators for Executable DSLs
inferred← citeshttps://doi.org/10.1007/978-3-540-24725-8_3openalex-snapshot
Strong Preservation as Completeness in Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-540-25975-6_40openalex-snapshot
Cooperation of Processes through Message Level Agreement
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_10openalex-snapshot
An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_9openalex-snapshot
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_25openalex-snapshot
On the Minimisation of Acyclic Models
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_10openalex-snapshot
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_36openalex-snapshot
Computing Stuttering Simulations
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_23openalex-snapshot
Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_16openalex-snapshot
Smaller Abstractions for ∀CTL* without Next
inferred← citeshttps://doi.org/10.1007/978-3-642-12814-1_19openalex-snapshot
Workflow Data Footprints
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_7openalex-snapshot
Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_41openalex-snapshot
Folk Theorems on the Correspondence between State-Based and Event-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-32943-2_16openalex-snapshot
A Cure for Stuttering Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-642-35873-9_3openalex-snapshot
Complete Abstractions Everywhere
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_41openalex-snapshot
Efficient Property Preservation Checking of Model Refinements
inferred← citeshttps://doi.org/10.1007/978-3-642-40229-6_17openalex-snapshot
Confluence Reduction for Markov Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-76562-9_13openalex-snapshot
Computer Aided Verification of Parallel Processes
inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_29openalex-snapshot
GPU Accelerated Strong and Branching Bisimilarity Checking
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_40openalex-snapshot
An $$O(m\log n)$$ Algorithm for Stuttering Equivalence and Branching Bisimulation
inferred← citeshttps://doi.org/10.1007/bf00121261openalex-snapshot
Automatic verification of distributed systems: The process algebra approach
inferred← citeshttps://doi.org/10.1007/bf01178922openalex-snapshot
Proving finiteness of CCS processes by non-standard semantics
inferred← citeshttps://doi.org/10.1007/bf02242704openalex-snapshot
Generating BDDs for symbolic model checking in CCS
inferred← citeshttps://doi.org/10.1007/bfb0035392openalex-snapshot
Compositional state space generation from Lotos programs
inferred← citeshttps://doi.org/10.1007/bfb0084783openalex-snapshot
Verification of parallel systems via decomposition
inferred← citeshttps://doi.org/10.1007/bfb0084805openalex-snapshot
Implementing LOTOS specifications by communicating state machines
inferred← citeshttps://doi.org/10.1007/s00165-007-0023-xopenalex-snapshot
Deciding orthogonal bisimulation
inferred← citeshttps://doi.org/10.1007/s00165-009-0133-8openalex-snapshot
Translating FSP into LOTOS and networks of automata
inferred← citeshttps://doi.org/10.1007/s00236-014-0195-9openalex-snapshot
An efficient simulation algorithm on Kripke structures
inferred← citeshttps://doi.org/10.1007/s00236-015-0226-1openalex-snapshot
Compositional verification of asynchronous concurrent systems using CADP
inferred← citeshttps://doi.org/10.1007/s00236-020-00375-6openalex-snapshot
A complete axiomatization of weighted branching bisimulation
inferred← citeshttps://doi.org/10.1007/s00236-020-00379-2openalex-snapshot
On the probabilistic bisimulation spectrum with silent moves
inferred← citeshttps://doi.org/10.1007/s002360050047openalex-snapshot
Timing and causality in process algebra
inferred← citeshttps://doi.org/10.1007/s10009-012-0244-zopenalex-snapshot
CADP 2011: a toolbox for the construction and analysis of distributed processes
inferred← citeshttps://doi.org/10.1007/s10270-022-01060-7openalex-snapshot
Linear parallel algorithms to compute strong and branching bisimilarity
inferred← citeshttps://doi.org/10.1007/s10559-012-9461-4openalex-snapshot
Investigating single-type structural elements of a component Petri net during component modeling and analysis of a complex system with parallelism
inferred← citeshttps://doi.org/10.1007/s10626-026-00434-zopenalex-snapshot
Unified bisimulation applied to incremental abstraction of Petri nets
inferred← citeshttps://doi.org/10.1007/s10703-006-0004-3openalex-snapshot
Cones and foci: A mechanical framework for protocol verification
inferred← citeshttps://doi.org/10.1007/s10703-023-00422-1openalex-snapshot
Compositional verification of priority systems using sharp bisimulation
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00132-8openalex-snapshot
Deciding true concurrency equivalences on safe, finite nets
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.11.028openalex-snapshot
Equivalences for Silent Transitions in Probabilistic Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.02.010openalex-snapshot
Specialization of Interaction Protocols in a Temporal Action Logic
inferred← citeshttps://doi.org/10.1016/j.ic.2008.01.001openalex-snapshot
Generalizing the Paige–Tarjan algorithm by abstract interpretation
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.025openalex-snapshot
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.06.332openalex-snapshot
Visible Bisimulation Equivalence — A Unified Abstraction for Temporal Logic Verification
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105947openalex-snapshot
Raiders of the lost equivalence: Probabilistic branching bisimilarity
inferred← citeshttps://doi.org/10.1016/j.is.2010.09.006openalex-snapshot
Similarity of business process models: Metrics and evaluation
inferred← citeshttps://doi.org/10.1016/j.jnca.2013.01.009openalex-snapshot
Model-driven approach supporting formal verification for web service composition protocols
inferred← citeshttps://doi.org/10.1016/j.scico.2015.08.005openalex-snapshot
Formal specification and verification of TCP extended with the Window Scale Option
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.010openalex-snapshot
Branching bisimulation for probabilistic systems: Characteristics and decidability
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00321-2openalex-snapshot
Inheritance of workflows: an approach to tackling problems related to change
inferred← citeshttps://doi.org/10.1016/s1567-8326(00)00004-7openalex-snapshot
Inheritance of behavior
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.004openalex-snapshot
The algorithmics of bisimilarity
inferred← citeshttps://doi.org/10.1093/logcom/exl035openalex-snapshot
Generalized Strong Preservation by Abstract Interpretation
inferred← citeshttps://doi.org/10.1109/43.845084openalex-snapshot
Model checking on timed-event structures
inferred← citeshttps://doi.org/10.1109/async.2018.00021openalex-snapshot
Model-Checking Synthesizable SystemVerilog Descriptions of Asynchronous Circuits
inferred← citeshttps://doi.org/10.1109/case48305.2020.9216950openalex-snapshot
Efficient Temporal Logic Verification by Incremental Abstraction
inferred← citeshttps://doi.org/10.1109/cscloud.2017.63openalex-snapshot
Malware Fingerprinting under Uncertainty
inferred← citeshttps://doi.org/10.1109/csf54842.2022.9919679openalex-snapshot
Mapping Synthesis for Hyperproperties
inferred← citeshttps://doi.org/10.1109/ddecs.2006.1649562openalex-snapshot
Minimization of Large State Spaces using Symbolic Branching Bisimulation
inferred← citeshttps://doi.org/10.1109/dsn.2018.00037openalex-snapshot
Branching Bisimulation and Concurrent Object Verification
inferred← citeshttps://doi.org/10.1109/etfa.2014.7005332openalex-snapshot
Verification of diagnosability based on compositional branching bisimulation
inferred← citeshttps://doi.org/10.1109/iceccs54210.2022.00018openalex-snapshot
Formalism- Driven Development of Decentralized Systems
inferred← citeshttps://doi.org/10.1109/icse.2012.6227150openalex-snapshot
Simulation-based abstractions for software product-line model checking
inferred← citeshttps://doi.org/10.1109/iscas.2001.922001openalex-snapshot
Abstractions for model checking of event timings
inferred← citeshttps://doi.org/10.1109/istcs.1995.377038openalex-snapshot
A partial order approach to branching time logic model checking
inferred← citeshttps://doi.org/10.1109/lics.1990.113739openalex-snapshot
Three logics for branching bisimulation
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470647openalex-snapshot
A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours
inferred← citeshttps://doi.org/10.1109/soca.2015.14openalex-snapshot
Design-Time Compliance of Service Compositions in Dynamic Service Environments
inferred← citeshttps://doi.org/10.1109/tetc.2017.2785299openalex-snapshot
Weird Machines, Exploitability, and Provable Unexploitability
inferred← citeshttps://doi.org/10.1109/tsc.2016.2579621openalex-snapshot
A Formal Model for Compliance Verification of Service Compositions
inferred← citeshttps://doi.org/10.1109/wodes.2016.7497855openalex-snapshot
Diagnosability verification using compositional branching bisimulation
inferred← citeshttps://doi.org/10.1134/s0361768811040013openalex-snapshot
Game-theoretic simulation checking tool
inferred← citeshttps://doi.org/10.1145/1570433.1570454openalex-snapshot
A bisimulation-based approach to the analysis of human-computer interaction
inferred← citeshttps://doi.org/10.1145/201019.201032openalex-snapshot
Three logics for branching bisimulation
inferred← citeshttps://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferred← citeshttps://doi.org/10.1145/3060140openalex-snapshot
An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
inferred← citeshttps://doi.org/10.1145/3571245openalex-snapshot
Fast Coalgebraic Bisimilarity Minimization
inferred← citeshttps://doi.org/10.1145/3839234openalex-snapshot
A Comprehensive History of μCRL and mCRL2
inferred← citeshttps://doi.org/10.1147/sj.314.0649openalex-snapshot
The European telecommunications research and development program RACE and its software project SPECS
inferred← citeshttps://doi.org/10.22028/d291-25945openalex-snapshot
Decision algorithms for probabilistic simulations
inferred← citeshttps://doi.org/10.3233/fi-2021-2039openalex-snapshot
Causal Semantics for BPP Nets with Silent Moves
inferred← citeshttps://doi.org/10.3390/app12073415openalex-snapshot
Formalism-Driven Development: Concepts, Taxonomy, and Practice
inferred← citeshttps://doi.org/10.3390/mca24020064openalex-snapshot
Bisimulation for Secure Information Flow Analysis of Multi-Threaded Programs
inferred← citeshttps://doi.org/10.3990/1.9789036536523openalex-snapshot
Qualitative and quantitative information flow analysis for multi-threaded programs
inferred← citeshttps://doi.org/10.4204/eptcs.14.3openalex-snapshot
Distributed Branching Bisimulation Minimization by Inductive Signatures
inferred← citeshttps://doi.org/10.4204/eptcs.182.2openalex-snapshot
Coherent branching feature bisimulation
inferred← citeshttps://doi.org/10.4204/eptcs.38.3openalex-snapshot
Port Protocols for Deadlock-Freedom of Component Systems
inferred← citeshttps://doi.org/10.4204/eptcs.387.5openalex-snapshot
A Cancellation Law for Probabilistic Processes
inferred← citeshttps://doi.org/10.46298/lmcs-17(3:15)2021openalex-snapshot
Relating Apartness and Bisimulation
inferred← citeshttps://doi.org/10.46298/lmcs-21(1:6)2025openalex-snapshot
Noninterference Analysis of Reversible Systems: An Approach Based on Branching Bisimilarity
inferred← citeshttps://doi.org/10.6100/ir716397openalex-snapshot
Probability and hiding in concurrent processes
inferred← citeshttps://doi.org/10.6100/ir757862openalex-snapshot
Advanced reduction techniques for model checking
inferred← citeshttps://doi.org/10.70675/d3af64e2z27b0z4354za1fczf56c69261924openalex-snapshot
Langages modernes pour la modélisation et la vérification des systèmes asynchrones
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.