On the public citation graph
Generating BDDs for symbolic model checking in CCS
0 signed · 60 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-50939-9_144openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1007/3-540-51525-9_11openalex-snapshot
Representation by finite automata
inferredcites →https://doi.org/10.1007/3-540-56496-9_16openalex-snapshot
Verification in process algebra of the distributed control of track vehicles—A case study
inferredcites →https://doi.org/10.1007/978-3-642-76562-9_13openalex-snapshot
Computer Aided Verification of Parallel Processes
inferredcites →https://doi.org/10.1007/bfb0032063openalex-snapshot
An efficient algorithm for branching bisimulation and stuttering equivalence
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/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470611012.ch3openalex-snapshot
An Introduction to Model Checking
inferred← citeshttps://doi.org/10.1006/jcss.1999.1683openalex-snapshot
Deciding Bisimilarity and Similarity for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/11513575_1openalex-snapshot
Genetic Algorithms for the Variable Ordering Problem of Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-44804-7_1openalex-snapshot
Advances in Model Representations
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_1openalex-snapshot
Model Checking: A Tutorial Overview
inferred← citeshttps://doi.org/10.1007/3-540-45605-8_12openalex-snapshot
Deriving Symbolic Representations from Stochastic Process Algebras
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_1openalex-snapshot
Norm Functions for Probabilistic Bisimulations with Delays
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_15openalex-snapshot
Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_39openalex-snapshot
Generation of reduced models for checking fragments of CTL
inferred← citeshttps://doi.org/10.1007/3-540-57264-3_29openalex-snapshot
Abstract interpretation and verification of reactive systems
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_12openalex-snapshot
Symbolic model checking and constraint logic programming: A cross-fertilization
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_11openalex-snapshot
Toupie: A constraint language for model checking
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_37openalex-snapshot
Generating BDD models for process algebra terms
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_44openalex-snapshot
Toupie=μ-calculus+constraints
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_57openalex-snapshot
Polynomial time algorithms for testing probabilistic bisimulation and simulation
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_199openalex-snapshot
Symbolic model checking for probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_50openalex-snapshot
μcke — Efficient μ-calculus model checking
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_771openalex-snapshot
Automated verifications of communication protocols using CCS and BDDs
inferred← citeshttps://doi.org/10.1007/978-0-387-34945-9_30openalex-snapshot
Sharing trees for “on-the-fly” verification
inferred← citeshttps://doi.org/10.1007/978-1-4471-0997-6_19openalex-snapshot
Automated Verification of Safety Requirements using CCS and Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-03240-0_9openalex-snapshot
Efficient Symbolic Model Checking for Process Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-29032-9_6openalex-snapshot
Scalable Stochastic Modelling for Resilience
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/bf01384080openalex-snapshot
Verification in process algebra of the distributed control of track vehicles?A case study
inferred← citeshttps://doi.org/10.1007/bfb0020979openalex-snapshot
Fischer's protocol revisited: A simple proof using modal constraints
inferred← citeshttps://doi.org/10.1007/bfb0021721openalex-snapshot
Advancements in symbolic traversal techniques
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50021-7openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.ins.2011.11.034openalex-snapshot
An enhanced flow analysis technique for detecting unreachability faults in concurrent systems
inferred← citeshttps://doi.org/10.1016/j.peva.2009.12.008openalex-snapshot
Symbolic partition refinement with automatic balancing of time and space
inferred← citeshttps://doi.org/10.1016/s1389-1286(99)00125-5openalex-snapshot
Using binary decision diagrams for representation and analysis of communication protocols
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00066-8openalex-snapshot
On the use of MTBDDs for performability analysis and verification of stochastic systems
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.004openalex-snapshot
The algorithmics of bisimilarity
inferred← citeshttps://doi.org/10.1023/a:1005732517165openalex-snapshot
Toupie: The µ-calculus over Finite Domains as a Constraint Language
inferred← citeshttps://doi.org/10.1080/00207721.2013.822940openalex-snapshot
Two-layer symbolic representation for stochastic models with phase-type distributed events
inferred← citeshttps://doi.org/10.1109/32.588539openalex-snapshot
Using a Protean language to enhance expressiveness in specification
inferred← citeshttps://doi.org/10.1109/71.553301openalex-snapshot
An application of Petri net reduction for Ada tasking deadlock analysis
inferred← citeshttps://doi.org/10.1109/csd.2001.981780openalex-snapshot
The BDD space complexity of different forms of concurrency
inferred← citeshttps://doi.org/10.1109/ddecs.2006.1649562openalex-snapshot
Minimization of Large State Spaces using Symbolic Branching Bisimulation
inferred← citeshttps://doi.org/10.1109/etc.1993.246534openalex-snapshot
System-level fault modeling and test pattern generation with process algebras
inferred← citeshttps://doi.org/10.1109/ictea.2012.6462862openalex-snapshot
A symbolic method for the web service composition problem
inferred← citeshttps://doi.org/10.1109/mascot.1995.378650openalex-snapshot
An efficient algorithm to compute the synchronized product
inferred← citeshttps://doi.org/10.1145/1190095.1190139openalex-snapshot
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
inferred← citeshttps://doi.org/10.31274/etd-180810-2060openalex-snapshot
Comparison of encoding schemes for symbolic model checking of bounded petri nets
inferred← citeshttps://doi.org/10.3233/978-1-60750-065-0-29openalex-snapshot
Combining Partial Order Reduction with Bounded Model Checking
inferred← citeshttps://doi.org/10.4108/smctools.2007.1918openalex-snapshot
Can matrix-layout-independent numerical solvers be efficient?: implementing the Moebius state-level abstract functional interface for ZDDs
inferred← citeshttps://doi.org/10.7146/brics.v6i30.20099openalex-snapshot
Structural Operational Semantics
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.