An alternative definition for timed automata composition

DOI10.1007/978-3-642-24372-1_9zbMATH Open1348.68092OpenAlexW199100790MaRDI QIDQ3172908FDOQ3172908

Authors: Jean-Paul Bodeveix, Abdeldjalil Boudjadar, Mamoun Filali 

Publication date: 7 October 2011

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_9

Recommendations

• Refinement and Consistency of Timed Modal Specifications
• Compositional verification for timed systems based on automatic invariant generation
• Revisiting timed specification theories: a linear-time perspective
• scientific article; zbMATH DE number 1751887
• Layered composition for timed automata

zbMATH Keywords

compositionrefinementtimed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• A refinement relation for families of timed automata
• Compositional verification for timed systems based on automatic invariant generation

Uses Software

• Uppaal

This page was built for publication: An alternative definition for timed automata composition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172908)