On the public citation graph

Model checking LTL using net unforldings

https://doi.org/10.1007/bfb0028746
0 signed · 34 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-51803-7_23openalex-snapshot
On the relation of programs and computations to models of temporal logic
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_33openalex-snapshot
On-the-fly verification with stubborn sets
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-58179-0_69openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
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/3-540-63139-9_26openalex-snapshot
Model checking LTL using constraint programming
inferredcites →https://doi.org/10.1007/3-540-63166-6_33openalex-snapshot
Relaxed visibility enhances partial order reduction
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/bf00709154openalex-snapshot
A stubborn attack on state explosion
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.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.1017/9781009024358.017openalex-snapshot
Information Processing
inferredcites →https://doi.org/10.1109/32.588521openalex-snapshot
The model checker SPIN
inferredcites →https://doi.org/10.1109/lics.1991.151664openalex-snapshot
A partial approach to model checking
inferredcites →https://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferredcites →https://doi.org/10.1145/359104.359108openalex-snapshot
An improved algorithm for decentralized extrema-finding in circular configurations of processes

What points at this work

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

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-44798-9_25openalex-snapshot
Net Reductions for LTL Model-Checking
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_40openalex-snapshot
A New Unfolding Approach to LTL Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45139-0_4openalex-snapshot
Implementing LTL model checking with net unfoldings
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_16openalex-snapshot
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders
inferred← citeshttps://doi.org/10.1007/3-540-46017-9_22openalex-snapshot
System Specification and Verification Using High Level Concepts — A Tool Demonstration
inferred← citeshttps://doi.org/10.1007/3-540-48745-x_22openalex-snapshot
Detection of Illegal Behaviours Based on Unfoldings
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_2openalex-snapshot
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4615-4493-7_43openalex-snapshot
Synthesis of Admissible Behavior of Petri Nets for Partial Order Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_9openalex-snapshot
Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings
inferred← citeshttps://doi.org/10.1007/s10515-025-00511-xopenalex-snapshot
On-the-fly unfolding with optimal exploration for linear temporal logic model checking of concurrent software and systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80293-2openalex-snapshot
Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding
inferred← citeshttps://doi.org/10.1109/edocw.2011.12openalex-snapshot
Querying Process Models Based on the Temporal Relations between Tasks
inferred← citeshttps://doi.org/10.5555/380921.380928openalex-snapshot
Implementing LTL model checking with net unfoldings
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.