Urgent Partial Order Reduction for Extended Timed Automata

DOI10.1007/978-3-030-59152-6_10MaRDI QIDQ6485866zbMATH OpenFDO

Authors Kim Gulstrand Larsen, Marius Mikučionis, Marco Muñiz, Jiří Srba

Publication date 22 December 2022

Published in 1517.68259 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59152-6_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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

• scientific article; zbMATH DE number 1361136
• Start pruning when time gets urgent: partial order reduction for timed systems
• Partial Order Reduction for Verification of Real-Time Components
• Delay-dependent partial order reduction technique for real time systems
• Timed automata with urgent transitions

Cited in

(8)

• Start pruning when time gets urgent: partial order reduction for timed systems
• Timed automata with urgent transitions
• A modeling concept for formal verification of OS-based compositional software
• Partial Order Reduction for Verification of Real-Time Components
• scientific article; zbMATH DE number 1361136 (Why is no real title available?)
• Let's be lazy, we have time -- or, lazy reachability analysis for timed automata
• Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
• Partial order reductions for timed systems

This page was built for publication: Urgent Partial Order Reduction for Extended Timed Automata

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