On the public citation graph
Minimal model generation
0 signed · 124 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-52148-8_30openalex-snapshot
Verification of synchronous sequential machines based on symbolic execution
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(92)90005-vopenalex-snapshot
The Esterel synchronous programming language: design, semantics, implementation
inferredcites →https://doi.org/10.1016/0890-5401(90)90025-dopenalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
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/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1145/41625.41641openalex-snapshot
LUSTRE: a declarative language for real-time programming
inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferredcites →https://doi.org/10.1145/800221.806724openalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722167_33openalex-snapshot
Syntactic Program Transformations for Automatic Abstraction
inferred← citeshttps://doi.org/10.1007/11516798_1openalex-snapshot
Protocol System Integration, Interface and Interoperability
inferred← citeshttps://doi.org/10.1007/11605157_3openalex-snapshot
Minimization of Non-deterministic Automata with Large Alphabets
inferred← citeshttps://doi.org/10.1007/11812128_21openalex-snapshot
On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
inferred← citeshttps://doi.org/10.1007/11817949_33openalex-snapshot
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
inferred← citeshttps://doi.org/10.1007/11901914_35openalex-snapshot
Sigref – A Symbolic Bisimulation Tool Box
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_14openalex-snapshot
Model Checking with Formula-Dependent Abstract Models
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_8openalex-snapshot
A Fast Bisimulation Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_36openalex-snapshot
Symbolic Algorithms for Infinite-State Games
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_8openalex-snapshot
Incremental Verification by Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_11openalex-snapshot
Symbolic Model Checking for Rectangular Hybrid Systems
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_2openalex-snapshot
A Classification of Symbolic Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_19openalex-snapshot
If: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_29openalex-snapshot
Bisimulation and Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_9openalex-snapshot
“Next” Heuristic for On-the-Fly Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_78openalex-snapshot
A tool set for deciding behavioral equivalences
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_100openalex-snapshot
Generating efficient code from data-flow programs
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_19openalex-snapshot
Bounded-memory algorithms for verification on-the-fly
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_10openalex-snapshot
Reachability and recurrence in Extended Finite State Machines: Modular Vector Addition Systems
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_18openalex-snapshot
An efficient algorithm for minimizing real-time transition systems
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_7openalex-snapshot
A tool for symbolic program verification and abstraction
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_8openalex-snapshot
Symbolic equivalence checking
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-57318-6_30openalex-snapshot
Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_85openalex-snapshot
Hybrid automata with finite bisimulations
inferred← citeshttps://doi.org/10.1007/978-0-387-34869-8_29openalex-snapshot
A tool for testing synchronous software
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-1-4615-3220-0_2openalex-snapshot
Fault Tolerance as Self-Similarity
inferred← citeshttps://doi.org/10.1007/978-3-030-91631-2_9openalex-snapshot
Model Finding for Exploration
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-031-22337-2_13openalex-snapshot
Simulation Relations and Applications in Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-72621-7_3openalex-snapshot
Computing Reachable Simulations on Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-75775-4_16openalex-snapshot
Model Checking and Strategy Synthesis with Abstractions and Certificates
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_8openalex-snapshot
Branching Bisimulation Learning
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_13openalex-snapshot
Abstraction and Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_21openalex-snapshot
The 10,000 Facets of MDP Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-24743-2_15openalex-snapshot
On O-Minimal Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_4openalex-snapshot
Abstraction as the Key for Invariant Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_29openalex-snapshot
Abstraction for Branching Time Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-71493-4_49openalex-snapshot
Reachability Algorithm for Biological Piecewise-Affine Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-78929-1_39openalex-snapshot
Parameter Synthesis for Piecewise Affine Systems from Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_19openalex-snapshot
Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs
inferred← citeshttps://doi.org/10.1007/bf00121127openalex-snapshot
On-the-fly verification of finite transition systems
inferred← citeshttps://doi.org/10.1007/bf01211218openalex-snapshot
Compositional failure-based semantic models for Basic LOTOS
inferred← citeshttps://doi.org/10.1007/bf01211911openalex-snapshot
Compositional minimisation of finite state systems using interface specifications
inferred← citeshttps://doi.org/10.1007/bfb0084783openalex-snapshot
Verification of parallel systems via decomposition
inferred← citeshttps://doi.org/10.1007/bfb0084802openalex-snapshot
Minimization of timed transition systems
inferred← citeshttps://doi.org/10.1007/s100090050012openalex-snapshot
Protocol verification with the ALDÉBARAN toolset
inferred← citeshttps://doi.org/10.1007/s10270-014-0416-2openalex-snapshot
Heuristic search for equivalence checking
inferred← citeshttps://doi.org/10.1016/0167-6423(92)90018-7openalex-snapshot
Minimal state graph generation
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00202-topenalex-snapshot
The algorithmic analysis of hybrid systems
inferred← citeshttps://doi.org/10.1016/b978-044482816-3/50032-0openalex-snapshot
ObjectInterconnecting the GEODE and CÆSAR-Aldébaran toolsets
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.014openalex-snapshot
Weighted o-minimal hybrid systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.010openalex-snapshot
Model Checking Multithreaded Programs by Means of Reduced Models
inferred← citeshttps://doi.org/10.1016/j.ic.2005.07.004openalex-snapshot
Using heuristic search for finding deadlocks in concurrent systems
inferred← citeshttps://doi.org/10.1016/j.jco.2004.09.003openalex-snapshot
On the expressiveness and decidability of o-minimal hybrid systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.03.003openalex-snapshot
DELFIN+: An efficient deadlock detection tool for CCS processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00361-xopenalex-snapshot
An efficient algorithm for computing bisimulation equivalence
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00038-9openalex-snapshot
Discrete-time control for rectangular hybrid automata
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80007-3openalex-snapshot
4 Computational modal logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80547-4openalex-snapshot
Rank-Based Symbolic Bisimulation
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.004openalex-snapshot
The algorithmics of bisimilarity
inferred← citeshttps://doi.org/10.1017/s1471068404002091openalex-snapshot
Ackermann encoding, bisimulations and OBDDs
inferred← citeshttps://doi.org/10.1023/a:1008621829508openalex-snapshot
An Efficient Algorithm for Minimizing Real-Time Transition Systems
inferred← citeshttps://doi.org/10.1023/a:1016043502772openalex-snapshot
Formula-Dependent Equivalence for Compositional CTL Model Checking
inferred← citeshttps://doi.org/10.1023/a:1016091902809openalex-snapshot
Bisimulation Minimization and Symbolic Model Checking
inferred← citeshttps://doi.org/10.1023/a:1027328830731openalex-snapshot
From Bisimulation to Simulation: Coarsest Partition Problems
inferred← citeshttps://doi.org/10.1093/logcom/exl035openalex-snapshot
Generalized Strong Preservation by Abstract Interpretation
inferred← citeshttps://doi.org/10.1109/5.871304openalex-snapshot
Discrete abstractions of hybrid systems
inferred← citeshttps://doi.org/10.1109/5.97300openalex-snapshot
The synchronous data flow programming language LUSTRE
inferred← citeshttps://doi.org/10.1109/acc.2008.4586912openalex-snapshot
Formal analysis of Piecewise Affine systems under parameter uncertainty with application to gene networks
inferred← citeshttps://doi.org/10.1109/allerton.2016.7852282openalex-snapshot
A bisimulation-like algorithm for abstracting control systems
inferred← citeshttps://doi.org/10.1109/caia.1994.323658openalex-snapshot
Optimization of rule-based expert systems via state transition system construction
inferred← citeshttps://doi.org/10.1109/cdc.2009.5399764openalex-snapshot
Representations and algorithms for finite-state bisimulations of linear discrete-time control systems
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717909openalex-snapshot
Formal analysis of piecewise affine systems through formula-guided refinement
inferred← citeshttps://doi.org/10.1109/cdc.2011.6161343openalex-snapshot
Finite-state simulations and bisimulations for discrete-time piecewise affine systems
inferred← citeshttps://doi.org/10.1109/cmpass.1994.318461openalex-snapshot
State minimization for concurrent system analysis based on state space exploration
inferred← citeshttps://doi.org/10.1109/iccd.1994.331900openalex-snapshot
Minimizing interacting finite state machines: a compositional approach to language containment
inferred← citeshttps://doi.org/10.1109/icse.1992.753504openalex-snapshot
A Toolbox For The Verification Of LOTOS Programs
inferred← citeshttps://doi.org/10.1109/indin.2013.6622948openalex-snapshot
Verification of hierarchical IEC 61499 component systems with behavioral event contracts
inferred← citeshttps://doi.org/10.1109/issre.1995.497669openalex-snapshot
Constructing operational profiles for synchronous critical software
inferred← citeshttps://doi.org/10.1109/memcod.2005.1487884openalex-snapshot
A synchronous language atwork: the story of lustre
inferred← citeshttps://doi.org/10.1109/real.1992.242667openalex-snapshot
An implementation of three algorithms for timing verification based on automata emptiness
inferred← citeshttps://doi.org/10.1109/services.2014.25openalex-snapshot
Powerful Equivalence Checking in the Bank Supply Process
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492576openalex-snapshot
Computing simulations on finite and infinite graphs
inferred← citeshttps://doi.org/10.1109/tac.2006.886494openalex-snapshot
Linear Time Logic Control of Discrete-Time Linear Systems
inferred← citeshttps://doi.org/10.1109/tac.2010.2072530openalex-snapshot
Formal Analysis of Discrete-Time Piecewise Affine Systems
inferred← citeshttps://doi.org/10.1109/tkde.2003.1185842openalex-snapshot
Model and algorithm for efficient verification of high-assurance properties of real-time systems
inferred← citeshttps://doi.org/10.1109/tse.2003.1205179openalex-snapshot
Heuristic search + local model checking in selective mu-calculus
inferred← citeshttps://doi.org/10.1117/12.169398openalex-snapshot
Response-time optimization of rule-based expert systems
inferred← citeshttps://doi.org/10.11185/imt.1.730openalex-snapshot
Verification of Transition System Reduction via PVS
inferred← citeshttps://doi.org/10.1142/s0218194099000139openalex-snapshot
AN INCREMENTAL VERIFICATION ALGORITHM FOR REAL-TIME SYSTEMS
inferred← citeshttps://doi.org/10.1145/1042038.1042039openalex-snapshot
A classification of symbolic transition systems
inferred← citeshttps://doi.org/10.1145/129712.129738openalex-snapshot
Online minimization of transition systems (extended abstract)
inferred← citeshttps://doi.org/10.1145/3365365.3382219openalex-snapshot
On abstraction-based controller design with output feedback
inferred← citeshttps://doi.org/10.1145/348019.348572openalex-snapshot
Environment modeling and language universality
inferred← citeshttps://doi.org/10.1145/3519939.3523715openalex-snapshot
Leapfrog: certified equivalence for protocol parsers
inferred← citeshttps://doi.org/10.1145/566171.566198openalex-snapshot
Refactoring design models for inductive verification
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.35.544openalex-snapshot
Static Analysis of Information Release in Interactive Programs
inferred← citeshttps://doi.org/10.21236/ada283477openalex-snapshot
Software Tools for Formal Specification and Verification of Distributed Real-Time Systems
inferred← citeshttps://doi.org/10.23919/ecc.2007.7068809openalex-snapshot
Model checking discrete-time Piecewise Affine systems: Application to gene networks
inferred← citeshttps://doi.org/10.46298/dmtcs.404openalex-snapshot
Words and bisimulations of dynamical systems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0101013openalex-snapshot
A Classification of Symbolic Transition Systems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0311018openalex-snapshot
Ackermann Encoding, Bisimulations, and OBDDs
inferred← citeshttps://doi.org/10.5555/2499634.2499642openalex-snapshot
Towards a theory of interface-based design of hierarchical reactive systems
inferred← citeshttps://doi.org/10.70675/60c377dbzbda4z4881z81b9ze3b12355d4c6openalex-snapshot
Modular analysis of numerical properties by abstract interpretation
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.