Temporal proof methodologies for timed transition systems
From MaRDI portal
Publication:1333273
DOI10.1006/inco.1994.1060zbMath0820.68085OpenAlexW2084880396MaRDI QIDQ1333273
Thomas A. Henzinger, Zohar Manna, Amir Pnueli
Publication date: 12 October 1994
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6096
Logic in artificial intelligence (68T27) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Categorical foundations for randomly timed automata, Semantic domains of timed event structures, Learning of event-recording automata, Verification in continuous time by discrete reasoning, Two-sorted metric temporal logics, Dynamic networks of heterogeneous timed machines, Automatic generation of path conditions for concurrent timed systems, Unifying behavioral equivalences of timed transition systems, The Unmet Challenge of Timed Systems, Unnamed Item, What good are digital clocks?, Slime mould games based on rough set theory, Event-clock automata: a determinizable class of timed automata, Deductive verification of real-time systems using STeP, Verification, refinement and scheduling of real-time programs, An embedding of timed transition systems in \(HOL\)
