On the public citation graph

Exploiting symmetry in linear time temporal logic model checking: One step beyond

0 signed · 36 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/3-540-56287-7_93openalex-snapshot
Fixed points of Büchi automata
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/3-540-56922-7_38openalex-snapshot
Symmetry and model checking
inferredcites →https://doi.org/10.1007/3-540-58043-3openalex-snapshot
A Decade of Concurrency Reflections and Perspectives
inferredcites →https://doi.org/10.1007/3-540-58043-3_19openalex-snapshot
Verification tools for finite-state concurrent systems
inferredcites →https://doi.org/10.1007/3-540-60029-9_43openalex-snapshot
Symbolic reachability graph and partial symmetries
inferredcites →https://doi.org/10.1007/3-540-60045-0_59openalex-snapshot
Utilizing symmetry when model checking under fairness assumptions: An automata-theoretic approach
inferredcites →https://doi.org/10.1007/3-540-60915-6_6openalex-snapshot
An automata-theoretic approach to linear temporal logic
inferredcites →https://doi.org/10.1007/978-0-387-34892-6_1openalex-snapshot
Simple On-the-fly Automatic Verification of Linear Temporal Logic
inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/978-3-642-84524-6openalex-snapshot
High-level Petri Nets
inferredcites →https://doi.org/10.1007/978-3-642-84524-6_13openalex-snapshot
On Well-Formed Coloured Nets and Their Symbolic Reachability Graph
inferredcites →https://doi.org/10.1007/bf00121128openalex-snapshot
Memory-efficient algorithms for the verification of temporal properties
inferredcites →https://doi.org/10.1007/bf00625968openalex-snapshot
Better verification through symmetry
inferredcites →https://doi.org/10.1007/bf00625970openalex-snapshot
Symmetry and model checking
inferredcites →https://doi.org/10.1007/bfb0015261openalex-snapshot
Alternating automata and program verification
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0030598openalex-snapshot
Model checking through symbolic reachability graph
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1090/dimacs/003/15openalex-snapshot
Memory efficient algorithms for the verification of temporal properties
inferredcites →https://doi.org/10.1145/262004.262008openalex-snapshot
Utilizing symmetry when model-checking under fairness assumptions
inferredcites →https://doi.org/10.1145/318593.318620openalex-snapshot
Modalities for model checking (extended abstract)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470611647.ch14openalex-snapshot
Symmetry and Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_12openalex-snapshot
From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking
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-35533-7_8openalex-snapshot
A Model Checking Method for Partially Symmetric Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-70952-7_5openalex-snapshot
Discovering Symmetries
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/s00287-004-0381-1openalex-snapshot
Model Checking
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)30749-8openalex-snapshot
Exploiting partial symmetries in well-formed nets for the reachability and the linear time model checking problems
inferred← citeshttps://doi.org/10.1109/acsd.2012.28openalex-snapshot
State Space Analysis Using Symmetries on Decision Diagrams
inferred← citeshttps://doi.org/10.1109/lics.2000.855761openalex-snapshot
Virtual symmetry reduction
inferred← citeshttps://doi.org/10.1145/1132960.1132962openalex-snapshot
Symmetry in temporal logic model checking
inferred← citeshttps://doi.org/10.14236/ewic/vecos2007.3openalex-snapshot
Towards Distributed Verification of Petri Nets Properties
inferred← citeshttps://doi.org/10.3233/fi-1999-37305openalex-snapshot
Finding Symmetries of Algebraic System Nets
inferred← citeshttps://doi.org/10.7146/dpb.v29i546.7080openalex-snapshot
State Space Methods for Coloured Petri Nets
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.