Superposition-Based Analysis of First-Order Probabilistic Timed Automata

DOI10.1007/978-3-642-16242-8_22zbMath1306.68095OpenAlexW2996581847MaRDI QIDQ4933313

Christoph Weidenbach, Holger Hermanns, Arnaud Fietzke

Publication date: 12 October 2010

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16242-8_22

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

A survey of timed automata for the development of real-time systems ⋮ Superposition as a decision procedure for timed automata ⋮ Superposition decides the first-order logic fragment over ground theories

Uses Software

• MoDeST

This page was built for publication: Superposition-Based Analysis of First-Order Probabilistic Timed Automata