Partial Order Reduction for State/Event LTL

DOI10.1007/978-3-642-00255-7_21zbMath1211.68244OpenAlexW1508747126MaRDI QIDQ3605476

J. Sochor, Nikola Beneš, Barbora Zimmerova, P. Vařeková, Luboš Brim, Ivana Černá

Publication date: 24 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00255-7_21

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (3)

The inconsistent labelling problem of stutter-preserving partial-order reduction ⋮ Partial Order Reduction for State/Event LTL ⋮ Optimising the ProB model checker for B using partial order reduction

Uses Software

• DiVinE
• MAGIC

Cites Work

• Stutter-invariant temporal properties are expressible without the next-time operator
• Concurrent software verification with states, events, and deadlocks
• Partial Order Reduction for State/Event LTL
• ZB 2005: Formal Specification and Development in Z and B
• Model Checking Software
• Integrated Formal Methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partial Order Reduction for State/Event LTL