Timed CSP = Closed Timed Automata1

DOI10.1016/S1571-0661(05)80369-XzbMath1270.68219MaRDI QIDQ2842610

Joël Ouaknine, James Worrell

Publication date: 15 August 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

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)

Related Items (2)

Sound reasoning in \textit{tock}-CSP ⋮ Towards verification of computation orchestration

Cites Work

• Refusal testing
• Model-checking in dense real-time
• Real-time logics: Complexity and expressiveness
• Defining liveness
• The timed failures -- Stability model for CSP
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• Symbolic model checking for real-time systems
• An operational semantics for timed CSP
• What good are digital clocks?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Timed CSP = Closed Timed Automata1