Polychronous Automata and Their Use for Formal Validation of AADL Models

Frontiers of Computer Science - United States
doi 10.1007/s11704-017-6134-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Formal Verification of AADL Models Using UPPAAL

2017English

Virtual Prototyping AADL Architectures in a Polychronous Model of Computation

2008English

An Ocarina Extension for AADL Formal Semantics Generation

2018English

Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Formal Verification of AADL Specifications in the Topcased Environment

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Executing AADL Models With UML/MARTE

2009English

Incremental Validation of Formal Specifications

English

Algorithms for Structural and Dynamical Polychronous Groups Detection

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Reusing Formal Models

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy