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

DOI10.1007/978-3-319-96145-3_28MaRDI QIDQ6041133zbMATH OpenOpenAlexFDO

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

Publication date 26 May 2023

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Urgent Partial Order Reduction for Extended Timed Automata
• scientific article; zbMATH DE number 1361136
• Delay-dependent partial order reduction technique for real time systems
• Delay-Dependent Partial Order Reduction Technique for Time Petri Nets
• Partial-Order Reduction

Cited in

(6)

• Stubborn set reduction for timed reachability and safety games
• Partial order reduction for reachability games
• Automata-driven partial order reduction and guided search for LTL model checking
• Urgent Partial Order Reduction for Extended Timed Automata
• Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
• scientific article; zbMATH DE number 7649924 (Why is no real title available?)

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

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