Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
From MaRDI portal
Publication:3522918
DOI10.1007/11901914_25zbMath1161.68566OpenAlexW1518419080MaRDI QIDQ3522918
Publication date: 4 September 2008
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11901914_25
Related Items (5)
Comparing disjunctive modal transition systems with an one-selecting variant ⋮ More Precise Partition Abstractions ⋮ Model Checking for Action Abstraction ⋮ Refinement Sensitive Formal Semantics of State Machines With Persistent Choice ⋮ Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
Uses Software
This page was built for publication: Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
