Exploiting over- and under-approximations for infinite-state counterpart models

DOI10.1007/978-3-642-33654-6_4MaRDI QIDQ2918971zbMATH OpenOpenAlexWikidataFDO

Authors Fabio Gadducci, Alberto Lluch Lafuente, Andrea Vandin

Publication date 2 October 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://eprints.imtlucca.it/1292/1/icgt2012.pdf

zbMATH Keywords

simulationsmodel checkingabstractionapproximationsgraph logicsgraph transition systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Recommendations

• A framework for the verification of infinite-state graph transformation systems
• scientific article; zbMATH DE number 2016064
• scientific article; zbMATH DE number 2090850
• A Modal-Logic Based Graph Abstraction
• Verifying a behavioural logic for graph transformation systems

Cited in

(1)

• A presheaf semantics for quantified temporal logics

This page was built for publication: Exploiting over- and under-approximations for infinite-state counterpart models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2918971)