Rank and simulation: the well-founded case

DOI10.1093/LOGCOM/EXT066zbMath1328.68147OpenAlexW2098286111MaRDI QIDQ3458888

Carla Piazza, Alberto Policriti, Raffaella Gentilini

Publication date: 28 December 2015

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fc5e305e27c36f9f66cfa5bc0465b33cbc61fe85

zbMATH Keywords

ranksimulation algorithmssimulation preorderdirected acyclic graphs (DAGS)simulation quotient

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

An efficient simulation algorithm on Kripke structures

This page was built for publication: Rank and simulation: the well-founded case