Start pruning when time gets urgent: partial order reduction for timed systems

DOI10.1007/978-3-319-96145-3_28zbMath1511.68180OpenAlexW2884909450MaRDI QIDQ6041133

Jiří Srba, Kim Guldstrand Larsen, Marco Muñiz, Peter Gjøl Jensen, Frederik M. Bønneland

Publication date: 26 May 2023

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-96145-3_28

Mathematics Subject Classification ID

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

Related Items (4)

Stubborn set reduction for timed reachability and safety games ⋮ Automata-driven partial order reduction and guided search for LTL model checking ⋮ Unnamed Item ⋮ Partial order reduction for reachability games

This page was built for publication: Start pruning when time gets urgent: partial order reduction for timed systems