A formal theory of simulations between infinite automata
- 1 August 1993
- journal article
- research article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 3 (1-2) , 117-149
- https://doi.org/10.1007/bf01383986
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Package For Inductive Relation Definitions In HOLPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Formal verification of state-machines using higher-order logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Formal verification of cache systems using refinement relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Verification of a multiprocessor cache protocol using simulation relations and higher-order logicFormal Methods in System Design, 1992
- The existence of refinement mappingsTheoretical Computer Science, 1991
- HOL: A Proof Generating System for Higher-Order LogicPublished by Springer Nature ,1988
- Recognizing safety and livenessDistributed Computing, 1987
- Infinite sequences and finite machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1963
- Sur les correspondances multivoques des ensemblesFundamenta Mathematicae, 1926