SAT-based verification for timed component connectors

DOI10.1016/J.SCICO.2011.02.003zbMATH Open1279.68212OpenAlexW2137162774MaRDI QIDQ433331FDOQ433331

Stephanie Kemper

Publication date: 13 July 2012

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2011.02.003

Recommendations

• SAT-based verification for timed component connectors
• Verification of timed automata via satisfiability checking
• scientific article; zbMATH DE number 1955911
• Formal Modeling and Analysis of Timed Systems
• Verification of asynchronous circuits using timed automata
• Using Coq for formal modeling and verification of timed connectors
• Formal Methods for Hardware Verification
• scientific article; zbMATH DE number 2064232

zbMATH Keywords

model checkingSATabstraction refinementcomponent-based software engineeringtimed constraint automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Reo: a channel-based coordination model for component composition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Calculi for synchrony and asynchrony
• Title not available (Why is that?)
• A timed model for communicating sequential processes
• Abstractions from proofs
• Title not available (Why is that?)
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification
• Bounded model checking using satisfiability solving
• Modeling component connectors in Reo by constraint automata
• Process algebra with timing
• A brief history of process algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Formal Verification for Components and Connectors
• Linear templates of ACTL formulas with an application to SAT-based verification

Uses Software

• Reo
• Chaff
• FOCI
• Esterel

This page was built for publication: SAT-based verification for timed component connectors

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