Finite Bisimulations for Dynamical Systems with Overlapping Trajectories - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Finite Bisimulations for Dynamical Systems with Overlapping Trajectories

Abstract

Having a finite bisimulation is a good feature for a dynamical system, since it can lead to the decidability of the verification of reachability properties. We investigate a new class of o-minimal dynamical systems with very general flows, where the classical restrictions on trajectory intersections are partly lifted. We identify conditions, that we call Finite and Uniform Crossing: When Finite Crossing holds, the time-abstract bisimulation is computable and, under the stronger Uniform Crossing assumption, this bisimulation is finite and definable.
No file

Dates and versions

hal-02077795 , version 1 (23-03-2019)

Identifiers

Cite

Béatrice Bérard, Patricia Bouyer, Vincent Jugé. Finite Bisimulations for Dynamical Systems with Overlapping Trajectories. 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), Sep 2018, Birmingham, United Kingdom. pp.26:1--26:17, ⟨10.4230/LIPIcs.CSL.2018.26⟩. ⟨hal-02077795⟩
60 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More