{"payload":{"pageCount":2,"repositories":[{"type":"Public","name":"ReachabilityAnalysis.jl","owner":"JuliaReach","isFork":false,"description":"Computing reachable states of dynamical systems in Julia","allTopics":["julia","verification","ode","simulations","dynamical-systems","control-systems","differential-equations","interval-arithmetic","hybrid-systems","formal-verification","numerical-analysis","cyber-physical-systems","reachability-analysis","automatic-control","flowpipe","rigorous-numerics","set-propagation"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":4,"issueCount":142,"starsCount":190,"forksCount":17,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-21T09:12:37.618Z"}},{"type":"Public","name":"LazySets.jl","owner":"JuliaReach","isFork":false,"description":"Scalable symbolic-numeric set computations in Julia","allTopics":["calculus","geometry","julia","computational-geometry","convex-hull","lazy-evaluation","polygons","projections","formal-verification","polyhedra","sets","minkowski-sum","reachability-analysis","convex-sets","geometry-algorithms","zonotope","set-propagation"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":7,"issueCount":364,"starsCount":226,"forksCount":32,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-14T06:07:27.461Z"}},{"type":"Public","name":"IntervalMatrices.jl","owner":"JuliaReach","isFork":false,"description":"Matrices with interval coefficients in Julia","allTopics":["interval-arithmetic","intervals","matrix-computations","reachability-analysis","matrix-exponential"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":16,"starsCount":18,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-14T06:03:32.649Z"}},{"type":"Public","name":"ReachabilityBase.jl","owner":"JuliaReach","isFork":false,"description":"Base library for the JuliaReach ecosystem","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":3,"starsCount":2,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-11T21:08:52.698Z"}},{"type":"Public","name":"NeuralNetworkReachability.jl","owner":"JuliaReach","isFork":false,"description":"Set propagation for neural networks in Julia","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":5,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T20:01:45.175Z"}},{"type":"Public","name":"ReachabilityModels.jl","owner":"JuliaReach","isFork":false,"description":"JuliaReach model library","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":29,"starsCount":5,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T19:50:15.138Z"}},{"type":"Public","name":"SpaceExParser.jl","owner":"JuliaReach","isFork":false,"description":"Parser for the SpaceEx modeling language in Julia","allTopics":["hybrid-systems","model-based-design","spaceex"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":14,"starsCount":7,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T17:52:45.894Z"}},{"type":"Public","name":"BernsteinExpansions.jl","owner":"JuliaReach","isFork":false,"description":"Computing Bernstein coefficients of multivariate polynomials in Julia","allTopics":["polynomials","intervals","bernstein"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":8,"starsCount":10,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T15:48:31.871Z"}},{"type":"Public","name":"MathematicalSystems.jl","owner":"JuliaReach","isFork":false,"description":"Systems definitions in Julia","allTopics":["julia","dynamical-systems"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":29,"starsCount":42,"forksCount":6,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T15:47:19.691Z"}},{"type":"Public","name":"MathematicalPredicates.jl","owner":"JuliaReach","isFork":false,"description":"Predicate definitions in Julia","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":2,"starsCount":4,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T15:17:19.000Z"}},{"type":"Public","name":"MathematicalSets.jl","owner":"JuliaReach","isFork":false,"description":"Set definitions in Julia","allTopics":["julia","sets"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":8,"starsCount":5,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T14:04:00.561Z"}},{"type":"Public template","name":"JuliaReachTemplatePkg.jl","owner":"JuliaReach","isFork":false,"description":"JuliaReach package template","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T11:50:00.705Z"}},{"type":"Public","name":"RangeEnclosures.jl","owner":"JuliaReach","isFork":false,"description":"Enclosures of real-valued functions in Julia","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":3,"issueCount":14,"starsCount":22,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T11:37:33.730Z"}},{"type":"Public","name":"ReachabilityBenchmarks","owner":"JuliaReach","isFork":false,"description":"JuliaReach benchmark suite","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":5,"issueCount":21,"starsCount":4,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T11:33:49.541Z"}},{"type":"Public","name":"ClosedLoopReachability.jl","owner":"JuliaReach","isFork":false,"description":"Reachability analysis for closed-loop control systems in Julia","allTopics":["neural-network","robotics","control-systems","differential-equations","hybrid-systems","robustness"],"primaryLanguage":{"name":"Polar","color":"#ae81ff"},"pullRequestCount":0,"issueCount":7,"starsCount":44,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T07:33:45.766Z"}},{"type":"Public","name":"CarlemanLinearization.jl","owner":"JuliaReach","isFork":false,"description":"Carleman linearization for dynamical systems in Julia","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":6,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T06:05:21.210Z"}},{"type":"Public","name":"JuliaReachDevDocs","owner":"JuliaReach","isFork":false,"description":"JuliaReach development guidelines and resources","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":3,"starsCount":1,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T06:05:21.749Z"}},{"type":"Public","name":"ControllerFormats.jl","owner":"JuliaReach","isFork":false,"description":"Controller formats in Julia","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-09T06:05:20.531Z"}},{"type":"Public","name":"ARCH2024_AFF_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability package for ARCH-COMP 2024 AFF","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-01T14:37:25.553Z"}},{"type":"Public","name":"ARCH2024_AINNCS_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability package for ARCH-COMP 2024 AINNCS","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-09T09:03:11.425Z"}},{"type":"Public","name":"ARCH2024_NLN_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability package for ARCH-COMP 2024 NLN","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-09T09:00:16.875Z"}},{"type":"Public","name":"JuliaReach-website","owner":"JuliaReach","isFork":false,"description":"Website of the JuliaReach organization","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":1,"starsCount":5,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-31T13:29:03.017Z"}},{"type":"Public","name":"ARCH2023_AINNCS_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability package for ARCH-COMP 2023 AINNCS","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-12T07:54:37.332Z"}},{"type":"Public","name":"ARCH2023_NLN_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability package for ARCH-COMP 2023 NLN","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-12T07:54:34.141Z"}},{"type":"Public","name":"ARCH2023_AFF_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability package for ARCH-COMP 2023 AFF","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-12T07:54:30.595Z"}},{"type":"Public","name":"Flowstar.jl","owner":"JuliaReach","isFork":false,"description":"Julia wrapper for Flow*","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":3,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-15T17:13:51.537Z"}},{"type":"Public","name":"Notebooks","owner":"JuliaReach","isFork":false,"description":"JuliaReach notebooks","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-10T12:58:24.868Z"}},{"type":"Public","name":"AISoLA2023_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability package for AISoLA 2023","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-25T20:26:41.760Z"}},{"type":"Public","name":"ARCH2022_AINNCS_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability evaluation package for the ARCH2022 AINNCS competition","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-20T06:50:24.095Z"}},{"type":"Public","name":"ARCH2022_NLN_RE","owner":"JuliaReach","isFork":false,"description":"Repeatability evaluation package for the ARCH2022 NLN competition","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-20T06:50:17.255Z"}}],"repositoryCount":57,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"JuliaReach repositories"}