Efficient Simplification of Bisimulation Formulas

Efficient Simplification of Bisimulation Formulas (1995)

Cached

Download Links

[ftp.imada.ou.dk]

Other Repositories/Bibliography

DBLP

by Uffe H. Engberg , Kim S. Larsen

Venue:	In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 111--132. LNCS 1019
Citations:	1 - 0 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Efficient Simplification of Bisimulation Formulas	SVM HeaderParse 0.2
AUTHOR NAME	Uffe H. Engberg	SVM HeaderParse 0.2
AUTHOR AFFIL	BRICS; Department of Computer Science, University of Aarhus	SVM HeaderParse 0.2
AUTHOR ADDR	Denmark	SVM HeaderParse 0.2
AUTHOR NAME	Kim S. Larsen	SVM HeaderParse 0.2
AUTHOR AFFIL	y; Department of Mathematics and Computer Science, Odense University	SVM HeaderParse 0.2
AUTHOR ADDR	Denmark	SVM HeaderParse 0.2
ABSTRACT	The problem of checking or optimally simplifying bisimulation formulas is likely to be computationally very hard. We take a different view at the problem: we set out to define a very fast algorithm, and then see what we can obtain. Sometimes our algorithm can simplify a formula perfectly, sometimes it cannot. However, the algorithm is extremely fast and can, therefore, be added to formula-based bisimulation model checkers at practically no cost. When the formula can be simplified by our algorithm, this can have a dramatic positive effect on the better, but also more time consuming, theorem provers which will finish the job. 1 Introduction The need for validity checking or optimal simplification of first order bisimulation formulas has arisen from recent work on symbolic bisimulation checking of value-passing calculi [4, 9, 15]. The NP-completeness of checking satisfiability of propositional formulas [3] implies that validity checking of that class of formulas is co-NP complete. Addit...	user correction - Legacy Corrections
YEAR	1995	INFERENCE
VENUE	In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 111--132. LNCS 1019	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	20 found	ParsCit 1.0