Case study: Formal verification of a computerized railway interlocking
From MaRDI portal
Publication:1295867
DOI10.1007/s001650050021zbMath1111.68499OpenAlexW2007808472MaRDI QIDQ1295867
Publication date: 26 July 1999
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001650050021
Related Items (5)
A logic approach to decision taking in a railway interlocking system using Maple ⋮ A logic-algebraic approach to decision taking in a railway interlocking system ⋮ An approach from answer set programming to decision making in a railway interlocking system ⋮ An algebraic approach to DC railway electrification verification ⋮ First order Stålmarck. Universal lemmas through branch merges
This page was built for publication: Case study: Formal verification of a computerized railway interlocking
