“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
An improved protocol reachability analysis technique
Software—Practice & Experience
Structured operational semantics and bisimulation as a congruence
Information and Computation
Journal of the ACM (JACM)
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Science of Computer Programming
ACM Transactions on Computational Logic (TOCL)
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Memory Efficient Algorithms for the Verification of Temporal Properties
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Generation of Reduced Models for Checking Fragments of CTL
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
A New Efficient Simulation Equivalence Algorithm
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Memory efficient state space storage in explicit software model checking
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Five Determinisation Algorithms
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
A Space-Efficient Probabilistic Simulation Algorithm
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
An algorithm for probabilistic alternating simulation
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A structural approach to indexing triples
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Logical difference computation with CEX2.5
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Saving Space in a Time Efficient Simulation Algorithm
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
The logical difference for the lightweight description logic EL
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of the same order as the size of the output of the algorithm. Of these, the one with the best time complexity exploits the representation of the simulation problem as a generalised coarsest partition problem. It is based on a fixed-point operator for obtaining a generalised coarsest partition as the limit of a sequence of partition pairs. We show that this fixed-point theory is flawed, and that the algorithm is incorrect. Although we do not see how the fixed-point operator can be repaired, we correct the algorithm without affecting its space and time complexity.