Timed CSP = closed timed automata
From MaRDI portal
Recommendations
Cites work
- A theory of timed automata
- An operational semantics for timed CSP
- Defining liveness
- Event-clock automata: a determinizable class of timed automata
- scientific article; zbMATH DE number 1693430 (Why is no real title available?)
- scientific article; zbMATH DE number 3956423 (Why is no real title available?)
- scientific article; zbMATH DE number 1304998 (Why is no real title available?)
- scientific article; zbMATH DE number 2080039 (Why is no real title available?)
- Model-checking in dense real-time
- Real-time logics: Complexity and expressiveness
- Refusal testing
- Symbolic model checking for real-time systems
- The timed failures -- Stability model for CSP
- What good are digital clocks?
Cited in
(7)- Checking noninterference in timed CSP
- Sound reasoning in \textit{tock}-CSP
- scientific article; zbMATH DE number 2059569 (Why is no real title available?)
- scientific article; zbMATH DE number 2080039 (Why is no real title available?)
- The expressive power of clocks
- A brief history of Timed CSP
- Towards verification of computation orchestration
This page was built for publication: Timed CSP = closed timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842610)