Model Checking for Probabilistic Timed Automata

Formal Methods in System Design - Netherlands
doi 10.1007/s10703-012-0177-x
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Timed-Automata Based Model-Checking of a Multi-Agent System: A Case Study

Journal of Software Engineering and Applications
2015English

Symbolic Model Checking for Simply-Timed Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Model Checking of Multitasking Real-Time Applications Based on the Timed Automata Model Using One Clock

2010English

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Fuzzy-Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Counterexamples in Probabilistic Model Checking

English

Pumping Lemmas for Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Discrete Timed Automata

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy