SAT-based verification for timed component connectors

MaRDI QIDQ2989003zbMATH OpenFDO

Authors Stephanie Kemper

Publication date 19 May 2017

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066109004472?np=y

zbMATH Keywords

model checkingSATabstraction refinementcomponent-based software engineeringtimed constraint automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Recommendations

• SAT-based verification for timed component connectors
• scientific article; zbMATH DE number 1973987
• SAT based bounded model checking with partial order semantics for timed automata
• SAT-based unbounded model checking of timed automata
• Verification of timed automata via satisfiability checking

Cited in

(5)

• SAT-based verification for timed component connectors
• Using Coq for formal modeling and verification of timed connectors
• Formal Verification for Components and Connectors
• Verification of context-dependent channel-based service models
• Reo + \(\mathrm{mCRL2}\): a framework for model-checking dataflow in service compositions

Describes a project that uses

Uses Software

• Reo
• Chaff
• FOCI

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 Q2989003)