Model checking for a class of weighted automata

DOI10.1007/s10626-008-0057-0zbMath1206.68186arXivcs/0304021MaRDI QIDQ5962025

Peter Buchholz, Peter Kemper

Publication date: 16 September 2010

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0304021

zbMATH Keywords

model checking; bisimulation; finite automata; semirings; valued computational tree logic; weighted automata

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

Model checking computation tree logic over finite lattices, Adding pebbles to weighted automata: easy specification \& efficient evaluation

Cites Work

• Model-checking in dense real-time
• Reduced systems in Markov chains and their applications in queueing theory
• Polytime model checking for times probabilistic computation tree logic
• Bisimulation through probabilistic testing
• Symbolic model checking: \(10^{20}\) states and beyond
• A theory of timed automata
• A logic for reasoning about time and reliability
• Bisimulation relations for weighted automata
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Algebraic laws for nondeterminism and concurrency
• Performance evaluation of (max,+) automata
• A Compositional Approach to Performance Modelling
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Min-max Computation Tree Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item