On the public citation graph

Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems

0 signed · 31 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-44622-2_19openalex-snapshot
Disjunctive Tautologies as Synchronisation Schemes
inferredcites →https://doi.org/10.1007/978-1-4684-9449-5openalex-snapshot
Differential Topology
inferredcites →https://doi.org/10.1007/978-1-4939-9063-4openalex-snapshot
A Basic Course in Algebraic Topology
inferredcites →https://doi.org/10.1007/978-3-540-24743-2_15openalex-snapshot
On O-Minimal Hybrid Systems
inferredcites →https://doi.org/10.1007/978-3-540-30124-0_33openalex-snapshot
Pfaffian Hybrid Systems
inferredcites →https://doi.org/10.1007/978-3-662-05355-3openalex-snapshot
Algorithms in Real Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-94-007-1025-2openalex-snapshot
Normal Forms, Bifurcations and Finiteness Problems in Differential Equations
inferredcites →https://doi.org/10.1007/978-94-007-1025-2_5openalex-snapshot
Complexity of computations with Pfaffian and Noetherian functions
inferredcites →https://doi.org/10.1007/bf02570696openalex-snapshot
Complexity of stratification of semi-Pfaffian sets
inferredcites →https://doi.org/10.1007/pl00009858openalex-snapshot
O-Minimal Hybrid Systems
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/j.jco.2004.09.003openalex-snapshot
On the expressiveness and decidability of o-minimal hybrid systems
inferredcites →https://doi.org/10.1016/s0022-4049(99)00017-1openalex-snapshot
Betti numbers of semi-Pfaffian sets
inferredcites →https://doi.org/10.1017/cbo9780511525919openalex-snapshot
Tame Topology and O-minimal Structures
inferredcites →https://doi.org/10.1051/ita:1999123openalex-snapshot
Topologies, Continuity and Bisimulations
inferredcites →https://doi.org/10.1090/mmono/088openalex-snapshot
Fewnomials
inferredcites →https://doi.org/10.1090/s0894-0347-96-00216-0openalex-snapshot
Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
inferredcites →https://doi.org/10.1112/s0024609399216530openalex-snapshot
TAME TOPOLOGY AND O-MINIMAL STRUCTURES (London Mathematical Society Lecture Note Series 248)
inferredcites →https://doi.org/10.1112/s0024610703004939openalex-snapshot
BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETS
inferredcites →https://doi.org/10.4310/jdg/1090347525openalex-snapshot
Semialgebraic Sard Theorem for Generalized Critical Values

What points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.200510024openalex-snapshot
A note on the undecidability of the reachability problem for o-minimal dynamical systems
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_17openalex-snapshot
A Survey on Continuous Time Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-70881-0_23openalex-snapshot
Satisfiability of Viability Constraints for Pfaffian Dynamics
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_6openalex-snapshot
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
inferred← citeshttps://doi.org/10.1007/s00224-007-9019-4openalex-snapshot
Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.014openalex-snapshot
Weighted o-minimal hybrid systems
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104580openalex-snapshot
Polynomial interrupt timed automata: Verification and expressiveness
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.02.004openalex-snapshot
Computing combinatorial types of trajectories in Pfaffian Dynamics
inferred← citeshttps://doi.org/10.1109/tase.2012.2198917openalex-snapshot
Finite Bisimulation of Reactive Untimed Infinite State Systems Modeled as Automata With Variables
inferred← citeshttps://doi.org/10.2168/lmcs-6(1:1)2010openalex-snapshot
O-Minimal Hybrid Reachability Games
inferred← citeshttps://doi.org/10.46298/dmtcs.404openalex-snapshot
Words and bisimulations of dynamical systems
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.