SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata

DOI10.1007/978-3-642-12002-2_34zbMath1284.68412OpenAlexW1522276539MaRDI QIDQ3557090

Peter Niebert, Janusz Malinowski

Publication date: 27 April 2010

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12002-2_34

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Exploiting step semantics for efficient bounded model checking of asynchronous systems ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?

Uses Software

• IF-2.0
• POEM
• PicoSAT

This page was built for publication: SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata