On the public citation graph
Combining partial order and symmetry reductions
0 signed · 69 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.1006/inco.1998.2778openalex-snapshot
A Partial Order Approach to Branching Time Logic Model Checking
inferredcites →https://doi.org/10.1007/3-540-15204-0_13openalex-snapshot
Towards reachability trees for high-level petri nets
inferredcites →https://doi.org/10.1007/3-540-53863-1_36openalex-snapshot
Stubborn sets for reduced state space generation
inferredcites →https://doi.org/10.1007/3-540-56922-7_34openalex-snapshot
All from one, one for all: on model checking using representatives
inferredcites →https://doi.org/10.1007/3-540-56922-7_37openalex-snapshot
Exploiting symmetry in temporal logic model checking
inferredcites →https://doi.org/10.1007/bf00625968openalex-snapshot
Better verification through symmetry
inferredcites →https://doi.org/10.1007/bf00625969openalex-snapshot
Exploiting symmetry in temporal logic model checking
inferredcites →https://doi.org/10.1007/bfb0023731openalex-snapshot
Using partial orders to improve automatic verification methods
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.1090/dimacs/029/13openalex-snapshot
Partial order reduction: Linear and branching temporal logics and process algebras
inferredcites →https://doi.org/10.1109/istcs.1995.377038openalex-snapshot
A partial order approach to branching time logic model checking
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11604655_56openalex-snapshot
Efficient Symmetry Reduction for an Actor-Based Model
inferred← citeshttps://doi.org/10.1007/11691617_15openalex-snapshot
Exploiting Symmetry and Transactions for Partial Order Reduction of Rule Based Specifications
inferred← citeshttps://doi.org/10.1007/3-540-36135-9_5openalex-snapshot
A Nested Depth First Search Algorithm for Model Checking with Symmetry Reduction
inferred← citeshttps://doi.org/10.1007/3-540-44829-2_6openalex-snapshot
A Light-Weight Algorithm for Model Checking with Symmetry Reduction and Weak Fairness
inferred← citeshttps://doi.org/10.1007/3-540-45251-6_30openalex-snapshot
A Heuristic for Symmetry Reductions with Scalarsets
inferred← citeshttps://doi.org/10.1007/3-540-46017-9_5openalex-snapshot
Symmetry Reduction Criteria for Software Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_22openalex-snapshot
Integrating Low Level Symmetries into Reachability Analysis
inferred← citeshttps://doi.org/10.1007/978-0-387-35394-4_21openalex-snapshot
Exploiting Symmetry in Protocol Testing
inferred← citeshttps://doi.org/10.1007/978-0-387-35578-8_15openalex-snapshot
Exploiting Symmetry When Model-Checking Software
inferred← citeshttps://doi.org/10.1007/978-3-030-85037-1_3openalex-snapshot
Stubborn Set Reduction for Timed Reachability and Safety Games
inferred← citeshttps://doi.org/10.1007/978-3-031-85134-6_2openalex-snapshot
20 Years of Actor Model Checking with Rebeca From Dining Philosophers to Micro-services
inferred← citeshttps://doi.org/10.1007/978-3-319-17524-9_8openalex-snapshot
Partial Order Reduction and Symmetry with Multiple Representatives
inferred← citeshttps://doi.org/10.1007/978-3-319-47677-3_16openalex-snapshot
Exploiting Symmetry for Efficient Verification of Infinite-State Component-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_20openalex-snapshot
On Combining Symmetry Reduction and Symbolic Representation for Efficient Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_19openalex-snapshot
Efficient Path Finding with the Sweep-Line Method Using External Storage
inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_35openalex-snapshot
On Symmetries and Spotlights – Verifying Parameterised Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_32openalex-snapshot
On Combining State Space Reductions with Global Fairness Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_26openalex-snapshot
Towards a Model Checker for NesC and Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/bfb0028742openalex-snapshot
Structural symmetry and model checking
inferred← citeshttps://doi.org/10.1007/s00236-009-0111-xopenalex-snapshot
Symmetry and partial order reduction techniques in model checking Rebeca
inferred← citeshttps://doi.org/10.1007/s10009-004-0151-zopenalex-snapshot
Partial-order reduction and trail improvement in directed model checking
inferred← citeshttps://doi.org/10.1007/s10009-004-0154-9openalex-snapshot
Symmetry reductions for model checking of concurrent dynamic software
inferred← citeshttps://doi.org/10.1007/s10009-022-00672-0openalex-snapshot
Partial-order reduction for parity games and parameterised Boolean equation systems
inferred← citeshttps://doi.org/10.1007/s100090050012openalex-snapshot
Protocol verification with the ALDÉBARAN toolset
inferred← citeshttps://doi.org/10.1007/s100090050035openalex-snapshot
State space reduction using partial order techniques
inferred← citeshttps://doi.org/10.1007/s10703-010-0096-7openalex-snapshot
Context-aware counter abstraction
inferred← citeshttps://doi.org/10.1016/j.cl.2004.02.002openalex-snapshot
Employing symmetry reductions in model checking
inferred← citeshttps://doi.org/10.1016/j.scico.2008.09.001openalex-snapshot
Reconciling statechart semantics
inferred← citeshttps://doi.org/10.1016/s0065-2458(05)65002-4openalex-snapshot
Software Model Checking with Spin
inferred← citeshttps://doi.org/10.1023/a:1020581029371openalex-snapshot
A Natural Semantic Framework for ECATNets
inferred← citeshttps://doi.org/10.1023/b:ause.0000038937.18006.3dopenalex-snapshot
Cluster-Based Partial-Order Reduction
inferred← citeshttps://doi.org/10.1109/71.780866openalex-snapshot
Computer aided verification of Lamport's fast mutual exclusion algorithm using colored Petri nets and occurrence graphs with symmetries
inferred← citeshttps://doi.org/10.1109/ase.2001.989810openalex-snapshot
Enhancing partial-order reduction via process clustering
inferred← citeshttps://doi.org/10.1109/ase.2011.6100044openalex-snapshot
Supporting domain-specific state space reductions through local partial-order reduction
inferred← citeshttps://doi.org/10.1109/tse.2012.82openalex-snapshot
Verifying Linearizability via Optimized Refinement Checking
inferred← citeshttps://doi.org/10.1109/tse.2022.3174408openalex-snapshot
Towards Scalable Model Checking of Reflective Systems via Labeled Transition Systems
inferred← citeshttps://doi.org/10.1109/tsmca.2003.820582openalex-snapshot
Exploiting Equivalence Reduction and the Sweep-Line Method for Detecting Terminal States
inferred← citeshttps://doi.org/10.1145/1125808.1125809openalex-snapshot
Symbolic model checking of UML activity diagrams
inferred← citeshttps://doi.org/10.1145/1132960.1132962openalex-snapshot
Symmetry in temporal logic model checking
inferred← citeshttps://doi.org/10.26083/tuprints-00002818openalex-snapshot
Efficient Verification of Fault-Tolerant Message-Passing Protocols
inferred← citeshttps://doi.org/10.3390/sym2020799openalex-snapshot
Replication and Abstraction: Symmetry in Automated Formal Verification
inferred← citeshttps://doi.org/10.34726/hss.2016.39780openalex-snapshot
Kronecker algebra based analysis of shared memory concurrent systems
inferred← citeshttps://doi.org/10.3929/ethz-a-006213873openalex-snapshot
Model Checking Boolean Programs
inferred← citeshttps://doi.org/10.3990/1.9789090130866openalex-snapshot
Analysing industrial protocols with formal methods
inferred← citeshttps://doi.org/10.48550/arxiv.0901.0179openalex-snapshot
Techniques for Distributed Reachability Analysis with Partial Order and Symmetry based Reductions
inferred← citeshttps://doi.org/10.54337/aau429765826openalex-snapshot
Time For Stubborn Game Reductions
inferred← citeshttps://doi.org/10.5451/unibas-ep43150openalex-snapshot
Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning
inferred← citeshttps://doi.org/10.6100/ir549628openalex-snapshot
Enhancing state space reduction techniques for model checking
inferred← citeshttps://doi.org/10.70675/4731b3aezfbdaz4b44z8a23z8453dbb0b410openalex-snapshot
Modélisation et Vérification Formelles de Systèmes de Contrôle de Trains
inferred← citeshttps://doi.org/10.7146/dpb.v29i546.7080openalex-snapshot
State Space Methods for Coloured Petri Nets
inferred← citeshttps://doi.org/10.7907/hpa7-2b52openalex-snapshot
Concurrent System Design Using Flow
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.