SAT-based verification for timed component connectors

zbMATH Open1366.68172MaRDI QIDQ2989003FDOQ2989003

Authors: Stephanie Kemper 

Publication date: 19 May 2017

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

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

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)

Cited In (5)

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

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)