Reachability solution characterization of parametric real-time systems

Authors:
Farn Wang;Hsu-Chun Yen
Affiliations:
Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan 106, ROC;Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan 106, ROC
Venue:
Theoretical Computer Science - Implementation and application of automata
Year:
2004

Citing 10
Cited 0

A multiparameter analysis of the boundedness problem for vector addition systems

Journal of Computer and System Sciences
Parametric real-time reasoning

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Model-checking in dense real-time

Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Parametric timing analysis for real-time systems

Information and Computation
Parametric Analysis of Computer Systems

Formal Methods in System Design
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Untameable Timed Automata!

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Linear Parametric Model Checking of Timed Automata

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Parametric Quantitative Temporal Reasoning

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of characterizing the solution spaces for timed automata augmented by unknown timing parameters (called timing parameter automata (TPA)). The main contribution of this paper is that we identify three non-trivial subclasses of TPAs, namely, upper-bound, lower-bound and bipartite TPAs, and analyze how hard it is to characterize the solution spaces. As it turns out, we are able to give complexity bounds for the sizes of the minimal (resp., maximal) elements which completely characterize the upward-closed (resp., downward-closed) solution spaces of upper-bound (resp., lower-bound) TPAs. For bipartite TPAs, it is shown that their solution spaces are not semilinear in general. We also extend our analysis to TPAs equipped with counters without zero-test capabilities.