On Bounded Specifications

DOI10.1007/3-540-45653-8_2zbMath1275.68094OpenAlexW1605190994MaRDI QIDQ2996151

Orna Kupferman, Moshe Y. Vardi

Publication date: 6 May 2011

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45653-8_2

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) Temporal logic (03B44)

Related Items (8)

Spanning the spectrum from safety to liveness ⋮ Temporal Logic and Fair Discrete Systems ⋮ GSTE is partitioned model checking ⋮ Antichains and compositional algorithms for LTL synthesis ⋮ Certifying inexpressibility ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Checking Temporal Properties of Discrete, Timed and Continuous Behaviors ⋮ How Much Lookahead is Needed to Win Infinite Games?

This page was built for publication: On Bounded Specifications