SMT-based reachability analysis for simply-timed systems

DOI10.16926/M.2015.20.09OpenAlexW3111296951MaRDI QIDQ5040686FDOQ5040686

Authors: Agnieszka M. Zbrzezny, Andrzej Zbrzezny 

Publication date: 17 October 2022

Published in: Scientific Issues Jan Długosz University in Częstochowa. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.16926/m.2015.20.09

Recommendations

• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• SMT-based reachability checking for bounded time Petri nets
• SAT-based reachability checking for timed automata with discrete data
• Simple SMT-based bounded model checking for timed interpreted systems
• scientific article; zbMATH DE number 2064232

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• Rewriting modulo SMT and open system analysis
• Exact Incremental Analysis of Timed Automata with an SMT-Solver

This page was built for publication: SMT-based reachability analysis for simply-timed systems

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