Amanote Research

Amanote Research

    RegisterSign In

Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-48153-2_11
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1999

Authors
Marius BozgaOded MalerStavros Tripakis
Publisher

Springer Berlin Heidelberg


Related search

Discrete Timed Automata

English

Verification of Networks of Timed Automata Using mCRL2

2008 IEEE International Symposium on Parallel and Distributed Processing
2008English

Advances in Verification of Time Petri Nets and Timed Automata

Studies in Computational Intelligence
Artificial Intelligence
2006English

Quantitative Analysis of Real-Time Systems Using Priced Timed Automata

Communications of the ACM
Computer Science
2011English

Online Timed Pattern Matching Using Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Fuzzy-Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Time and Action Lock Freedom Properties for Timed Automata

English

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Efficient On-The-Fly Emptiness Check for Timed Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy