Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
From MaRDI portal
Publication:5756736
DOI10.1007/11817963_24zbMath1188.68192OpenAlexW1923222846MaRDI QIDQ5756736
Publication date: 5 September 2007
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11817963_24
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 (10)
Timed runtime monitoring for multiparty conversations ⋮ A survey of timed automata for the development of real-time systems ⋮ Cross-chain payment protocols with success guarantees ⋮ Reachability relations of timed pushdown automata ⋮ Timed Basic Parallel Processes ⋮ Event clock message passing automata: a logical characterization and an emptiness checking algorithm ⋮ Reachability results for timed automata with unbounded data structures ⋮ Automata and Logics for Timed Message Sequence Charts ⋮ Input urgent semantics for asynchronous timed session types ⋮ Checking conformance for time-constrained scenario-based specifications
This page was built for publication: Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
