On the public citation graph

Putting advanced reachability analysis techniques together: The “ARA” tool

https://doi.org/10.1007/bfb0024669
0 signed · 45 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-17906-2_21openalex-snapshot
Petri net tool overview 1986
inferredcites →https://doi.org/10.1007/3-540-52148-8_3openalex-snapshot
The concurrency workbench
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-54430-5_100openalex-snapshot
Using truth-preserving reductions to improve the clarity of kripke-models
inferredcites →https://doi.org/10.1007/3-540-54430-5_111openalex-snapshot
Reduced labelled transition systems save verification effort
inferredcites →https://doi.org/10.1007/3-540-54430-5_78openalex-snapshot
A tool set for deciding behavioral equivalences
inferredcites →https://doi.org/10.1007/3-540-56689-9_54openalex-snapshot
Compositional state space generation
inferredcites →https://doi.org/10.1007/bf00709154openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferredcites →https://doi.org/10.1007/bfb0084793openalex-snapshot
The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic
inferredcites →https://doi.org/10.1016/0165-6074(88)90016-6openalex-snapshot
Opening and keynote session
inferredcites →https://doi.org/10.1016/0165-6074(88)90154-8openalex-snapshot
PC-Rimst - a tool for validating concurrent program designs
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/0169-7552(87)90085-7openalex-snapshot
Introduction to the ISO specification language LOTOS
inferredcites →https://doi.org/10.1090/dimacs/003/06openalex-snapshot
Compositional minimization of finite state systems
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential 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/0-306-47003-9_22openalex-snapshot
Verification of Dense Time Properties Using Theories of Untimed Process Algebra
inferred← citeshttps://doi.org/10.1007/11589976_6openalex-snapshot
Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_14openalex-snapshot
Liveness and Fairness in Process-Algebraic Verification
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_3openalex-snapshot
Composition and Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_20openalex-snapshot
Checking for CFFD-Preorder with Tester Processes
inferred← citeshttps://doi.org/10.1007/3-540-58152-9_29openalex-snapshot
Compositional analysis with place-bordered subnets
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_90openalex-snapshot
Visual verification of safety and liveness
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-61648-9_43openalex-snapshot
Verification-driven development of a collision-avoidance protocol for the Ethernet
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_8openalex-snapshot
Using compositional preorders in the verification of sliding window protocol
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_22openalex-snapshot
Failure-based Equivalences Are Faster Than Many Believe
inferred← citeshttps://doi.org/10.1007/978-3-030-00244-2_13openalex-snapshot
Compositional Verification in Action
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-540-24730-2_12openalex-snapshot
Tampere Verification Tool
inferred← citeshttps://doi.org/10.1007/978-3-540-75664-4_12openalex-snapshot
Safety Property Analysis Techniques for Cooperating Embedded Systems Using LTS
inferred← citeshttps://doi.org/10.1007/bf01211218openalex-snapshot
Compositional failure-based semantic models for Basic LOTOS
inferred← citeshttps://doi.org/10.1016/0140-3664(95)01036-xopenalex-snapshot
Experiences with the integration of protocol software tools
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80412-2openalex-snapshot
Context-Sensitive Visibility
inferred← citeshttps://doi.org/10.1109/csd.1998.657541openalex-snapshot
Unbounded verification results by finite-state compositional techniques: 10/sup any/ states and beyond
inferred← citeshttps://doi.org/10.1109/empdp.1996.500586openalex-snapshot
Visualisation of reduced abstracted behaviour as a design tool
inferred← citeshttps://doi.org/10.1109/eurmic.1997.617255openalex-snapshot
Interactive codesign for real-time embedded control systems: task graph generation from SA/VHDL models
inferred← citeshttps://doi.org/10.1109/icapp.1996.562859openalex-snapshot
ARC-a tool for efficient refinement and equivalence checking for CSP
inferred← citeshttps://doi.org/10.1109/iceccs.2001.930166openalex-snapshot
Compositional construction of protocol behaviours with arbitrary channel capacities
inferred← citeshttps://doi.org/10.1145/1081180.1081191openalex-snapshot
On-the-fly state space reductions for weak equivalences
inferred← citeshttps://doi.org/10.1145/295558.295570openalex-snapshot
Checking safety properties using compositional reachability analysis
inferred← citeshttps://doi.org/10.3182/20060926-3-pl-4904.00038openalex-snapshot
STUBBORN SET METHOD FOR INTERPRETED PETRI NETS
inferred← citeshttps://doi.org/10.5281/zenodo.37614openalex-snapshot
Reduction Factors In Finite Automata With Application To Nonlinear Filters
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.