Amanote Research

Amanote Research

    RegisterSign In

Timed Unfoldings for Networks of Timed Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/11901914_23
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2006

Authors
Patricia BouyerSerge HaddadPierre-Alain Reynier
Publisher

Springer Berlin Heidelberg


Related search

Fuzzy-Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Verification of Networks of Timed Automata Using mCRL2

2008 IEEE International Symposium on Parallel and Distributed Processing
2008English

Discrete Timed Automata

English

Pumping Lemmas for Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Robustness in Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Model Checking for Probabilistic Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2012English

Robust Safety of Timed Automata

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
2008English

State Identification Problems for Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Frequencies in Forgetful Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy