Weighted o-minimal hybrid systems
type: Item
instance of: scholarly article
title: Weighted o-minimal hybrid systems
zbMATH Open document ID: 1219.68114
author: Patricia Bouyer
author: Thomas Brihaye
author: Fabrice Chevalier
published in: Annals of Pure and Applied Logic
publication date: 2011-08-26T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 5943589
zbMATH Keywords: o-minimal hybrid systems
zbMATH Keywords: optimal o-minimal hybrid games
zbMATH Keywords: model checking
zbMATH Keywords: temporal logic
zbMATH Keywords: decidability
describes a project that uses: UPPAAL CORA
MaRDI profile type: Publication
full work available at URL: j.apal.2009.07.014
OpenAlex ID: W2035999266
cites work: Automata, Languages and Programming
cites work: The algorithmic analysis of hybrid systems
cites work: A theory of timed automata
cites work: Q4552456
cites work: On the optimal reachability problem of weighted timed automata
cites work: Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
cites work: Hybrid Systems: Computation and Control
cites work: Improved undecidability results on weighted timed automata
cites work: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
cites work: Formal Modeling and Analysis of Timed Systems
cites work: On model-checking timed automata with stopwatch observers
cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
cites work: Q4037384
cites work: Q4552463
cites work: Model-Checking One-Clock Priced Timed Automata
cites work: Almost Optimal Strategies in One Clock Priced Timed Games
cites work: On the expressiveness and decidability of o-minimal hybrid systems
cites work: Q5387709
cites work: Topologies, Continuity and Bisimulations
cites work: Hybrid automata with finite bisimulations
cites work: Q4503930
cites work: Q4234084
cites work: A classification of symbolic transition systems
cites work: Q4336034
cites work: CCS expressions, finite state processes, and three problems of equivalence
cites work: Logical Approaches to Computational Barriers
cites work: O-minimal hybrid systems.
cites work: Q4397030
cites work: Definable Sets in Ordered Structures. I
cites work: Three Partition Refinement Algorithms
cites work: Q4392286
cites work: Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
cites work: Q4355928
DOI: 10.1016/J.APAL.2009.07.014
description: scientific article; zbMATH DE number 5943589