Partial order path technique for checking parallel timed automata

DOI10.1007/3-540-45739-9_24MaRDI QIDQ5392301zbMATH OpenOpenAlexFDO

Authors Jian-hua Zhao, He Xu, Xuandong Li, Tao Zheng, Guoliang Zheng

Publication date 8 April 2011

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

Full work available at URL https://doi.org/10.1007/3-540-45739-9_24

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

• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 1361136
• SAT based bounded model checking with partial order semantics for timed automata
• Partial Order Reduction for Verification of Real-Time Components
• A partial order semantics approach to the clock explosion problem of timed automata

Cited in

(4)

• Tools and Algorithms for the Construction and Analysis of Systems
• Performance evaluation of schedulers in a probabilistic setting
• SAT based bounded model checking with partial order semantics for timed automata
• scientific article; zbMATH DE number 1361136 (Why is no real title available?)

Describes a project that uses

Uses Software

• HyTech
• Kronos

This page was built for publication: Partial order path technique for checking parallel timed automata

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