On the public citation graph

Verification of large state/event systems using compositionality and dependency analysis

https://doi.org/10.1007/bfb0054173
0 signed · 46 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-52148-8_30openalex-snapshot
Verification of synchronous sequential machines based on symbolic execution
inferredcites →https://doi.org/10.1007/3-540-56922-7_4openalex-snapshot
An iterative approach to language containment
inferredcites →https://doi.org/10.1007/3-540-58179-0_63openalex-snapshot
Efficient model checking by automated ordering of transition relation partitions
inferredcites →https://doi.org/10.1007/3-540-61474-5_93openalex-snapshot
Symbolic model checking
inferredcites →https://doi.org/10.1007/978-1-4615-3190-6openalex-snapshot
Symbolic Model Checking
inferredcites →https://doi.org/10.1007/bfb0023716openalex-snapshot
Verifying temporal properties of sequential machines without building their state diagrams
inferredcites →https://doi.org/10.1007/bfb0030626openalex-snapshot
A compositional proof of a real-time mutual exclusion protocol
inferredcites →https://doi.org/10.1007/bfb0035379openalex-snapshot
Partial model checking with ROBDDs
inferredcites →https://doi.org/10.1016/0167-6423(87)90035-9openalex-snapshot
Statecharts: a visual formalism for complex systems
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1090/dimacs/003/07openalex-snapshot
Verifying temporal properties of sequential machines without building their state diagrams
inferredcites →https://doi.org/10.1109/43.275352openalex-snapshot
Symbolic model checking for sequential circuit verification
inferredcites →https://doi.org/10.1109/cmpass.1996.507877openalex-snapshot
Feasibility of model checking software requirements: a case study
inferredcites →https://doi.org/10.1109/lics.1989.39190openalex-snapshot
Compositional model checking
inferredcites →https://doi.org/10.1109/lics.1990.113767openalex-snapshot
Symbolic model checking: 10/sup 20/ states and beyond
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/186025.186051openalex-snapshot
Model checking and abstraction
inferredcites →https://doi.org/10.1145/239098.239127openalex-snapshot
Model checking large software specifications
inferredcites →https://doi.org/10.1145/250707.239127openalex-snapshot
Model checking large software specifications
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.1184/r1/6610106openalex-snapshot
Symbolic Model Checking with Partitioned Transition Relations
inferredcites →https://doi.org/10.5555/244522.244535openalex-snapshot
Tearing based automatic abstraction for CTL model checking

What points at this work

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

inferred← citeshttps://doi.org/10.1002/1097-024x(200102)31:2<191::aid-spe361>3.0.co;2-4openalex-snapshot
A realistic involvement of formal methods
inferred← citeshttps://doi.org/10.1007/3-540-45314-8_23openalex-snapshot
A Formal Object-Oriented Analysis for Software Reliability: Design for Verification
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_4openalex-snapshot
UPPAAL - Now, Next, and Future
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_28openalex-snapshot
Stepwise CTL Model Checking of State/Event Systems
inferred← citeshttps://doi.org/10.1007/3-540-49059-0_12openalex-snapshot
Verification of Hierarchical State/Event Systems Using Reusability and Compositionality
inferred← citeshttps://doi.org/10.1007/978-3-030-62822-2_5openalex-snapshot
Randomized Refinement Checking of Timed I/O Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_40openalex-snapshot
To Store or Not to Store
inferred← citeshttps://doi.org/10.1007/978-3-642-15349-5_2openalex-snapshot
Symbolic and Compositional Reachability for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-41533-3_19openalex-snapshot
Model Checking of UML-RT Models Using Lazy Composition
inferred← citeshttps://doi.org/10.1007/b107062openalex-snapshot
Fundamental Approaches to Software Engineering
inferred← citeshttps://doi.org/10.1007/s10009-002-0078-1openalex-snapshot
Managing the verification trajectory
inferred← citeshttps://doi.org/10.1007/s10270-005-0103-4openalex-snapshot
Separation of non-orthogonal concerns in software architecture and design
inferred← citeshttps://doi.org/10.1007/s10626-007-0036-xopenalex-snapshot
On-Line Monitoring of Large Petri Net Models Under Partial Observation
inferred← citeshttps://doi.org/10.1007/s10703-006-4617-3openalex-snapshot
Compositional SCC Analysis for Language Emptiness
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)37216-6openalex-snapshot
A Survey of Verification Techniques for Solving the State Explosion Problem
inferred← citeshttps://doi.org/10.1023/a:1016095519611openalex-snapshot
Verification of Hierarchical State/Event Systems using Reusability and Compositionality
inferred← citeshttps://doi.org/10.1023/b:form.0000033961.36239.68openalex-snapshot
Connectivity Testing
inferred← citeshttps://doi.org/10.1109/2.841786openalex-snapshot
Practical verification of embedded software
inferred← citeshttps://doi.org/10.1109/iccd.2012.6378645openalex-snapshot
A polynomial time flow for implementing free-choice Petri-nets
inferred← citeshttps://doi.org/10.1109/wift.1998.766303openalex-snapshot
Implementing statecharts in PROMELA/SPIN
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.7818openalex-snapshot
Succinct Set-Encoding for State-Space Search
inferred← citeshttps://doi.org/10.3990/1.9789036515641openalex-snapshot
Towards effective model checking
inferred← citeshttps://doi.org/10.54337/aau534292082openalex-snapshot
Efficient Model Checking: The Power of Randomness
inferred← citeshttps://doi.org/10.7146/brics.v6i41.20111openalex-snapshot
Verification of State/Event Systems by Quotienting
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.