Algorithmic Approach to Abstracting Linear Systems by Timed Automata*

IFAC Proceedings Volumes
doi 10.3182/20110828-6-it-1002.02568
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

From Time Petri Nets to Timed Automata: An Untimed Approach

English

Fuzzy-Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Or Forum—An Algorithmic Approach to Linear Regression

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2016English

A Linear Algebra Approach to Synchronizing Automata

English

Robust Reachability in Timed Automata: A Game-Based Approach

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Discrete Timed Automata

English

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Robustness in Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Quantitative Analysis of Real-Time Systems Using Priced Timed Automata

Communications of the ACM
Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy