On the public citation graph

Verification based on local states

https://doi.org/10.1007/bfb0054163
0 signed · 32 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.1006/inco.1994.1035openalex-snapshot
A Partial Approach to Model Checking
inferredcites →https://doi.org/10.1007/3-540-18088-5_24openalex-snapshot
A modal logic for a subclass of event structures
inferredcites →https://doi.org/10.1007/3-540-52048-1_40openalex-snapshot
An axiomatization of event structures
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-56496-9_14openalex-snapshot
Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits
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-60218-6_33openalex-snapshot
A trace consistent subset of PTL
inferredcites →https://doi.org/10.1007/3-540-60246-1_161openalex-snapshot
A ν-calculus with local views for systems of sequential agents
inferredcites →https://doi.org/10.1007/3-540-61042-1_40openalex-snapshot
An improvement of McMillan's unfolding algorithm
inferredcites →https://doi.org/10.1007/bf01383878openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferredcites →https://doi.org/10.1007/bf01463946openalex-snapshot
Branching processes of Petri nets
inferredcites →https://doi.org/10.1007/bfb0022474openalex-snapshot
Petri nets, event structures and domains
inferredcites →https://doi.org/10.1007/bfb0035386openalex-snapshot
Model-checking for a subclass of event structures
inferredcites →https://doi.org/10.1016/0167-6423(94)00019-0openalex-snapshot
Model checking using net unfoldings
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(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0005openalex-snapshot
Modal and Temporal Logics
inferredcites →https://doi.org/10.1109/lics.1991.151664openalex-snapshot
A partial approach to model checking
inferredcites →https://doi.org/10.1109/lics.1994.316047openalex-snapshot
A trace based extension of linear time temporal logic
inferredcites →https://doi.org/10.1142/s0129054192000103openalex-snapshot
TEMPORAL LOGICS FOR COMMUNICATING SEQUENTIAL AGENTS: I
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.1002/9780470611647.ch13openalex-snapshot
Petri Net Unfoldings — Properties
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_16openalex-snapshot
Independence: Logics and Concurrency
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_27openalex-snapshot
Local First Search — A New Paradigm for Partial Order Reductions
inferred← citeshttps://doi.org/10.1007/3-540-45484-5_2openalex-snapshot
Towards Formal Specification and Verification in Cyberspace
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_10openalex-snapshot
Mechanical Abstraction of CSPZ Processes
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_16openalex-snapshot
Model Checking Logics for Communicating Sequential Agents
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_4openalex-snapshot
Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-18222-8_4openalex-snapshot
SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets
inferred← citeshttps://doi.org/10.1016/s0167-6423(00)00023-xopenalex-snapshot
Model-checking CSP-Z: strategy, tool support and industrial application
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82524-1openalex-snapshot
Model checking of causal knowledge formulas
inferred← citeshttps://doi.org/10.1109/lics.2003.1210077openalex-snapshot
Model-checking trace event structures
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.