Simulation reduction as constraint

Electronic Notes in Theoretical Computer Science

Volumn 76, Issue , 2002, Pages 145-161

  Gentilini, R ^a   Piazza, C ^b   Policriti, A ^a  

^a UNIVERSITY OF UDINE   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER TESTING; CONSTRAINT THEORY; ENCODING (SYMBOLS); FORMAL LOGIC; LOGIC PROGRAMMING; POLYNOMIALS;

CONSTRAINT LOGIC PROGRAMMING (CLP); KRIPKE STRUCTURES; MODEL CHECKING; TEMPORAL LOGIC;

COMPUTER SCIENCE;

EID: 18944369640     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80791-6     Document Type: Conference Paper

References (15)

1. B. Bloom. Ready Simulation, Bisimulation and the Semantics of CCS-like languages. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, August 1989.
2. Bloom Bard, Paige Robert. Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming. 24:(3):June 1995;189-220
3. D. Bustan and O. Grumberg. Simulation based minimization. In D.A. McAllester, editor, Proc. Int'l Conference on Automated Deduction (CADE'00), volume 1831 of LNCS, pages 255-270. Springer, 2000.
4. Cleaveland R., Parrow J., Steffen B. The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems. ACM Transactions on Porgramming Languages and Systems. 15:(1):January 1993;36-72
5. R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. In K.G. Larsen and A. Skou, editors, Proc. of Int;l Conference Computer Aided Verification (CAV'91), volume 575 of LNCS, pages 48-58. Springer, 1992.
6. R. Cleaveland and L. Tan. Simulation revised. In T. Margaria and W. Yi, editors, Proc. Int'l Conference on Tools and Algorithms for the Constructin and Analysis of Systems (TACAS'01), volume 2031 of LNCS, pages 480-495 Springer, 2001.
7. Dover A., Omodeo E.G., Pontelli E., Rossi G. {log}: A language for programming in logic with finite sets. Journal of Logic Programming. 28:(1):1996;1-55
8. A. Dovier, C. Piazza, and A. Policriti. A fast bisimulation algorithm. In G. Berry, H. Comon, and A. Finkel, editors, Proc. of Int'l Conference Computer Aided Verification (CAV'01), volume 2102 of LNCS, pages 79-90. Springer, 2001.
9. Dovier A., Piazza C., Pontelli E., Rossi G. Sets and constraint logic programming. Transaction on Programming Languages and Systems. 22:(5):2001;861-931
10. R. Gentilini, C. Piazza, and A. policriti. Simulation as stable coarsest partition problem. In J. P. Katoen and P. Stevens, editors, Proc. of Int.l Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), volume 2280 of LNCS, pages 415-430. Springer, 2002.
11. C. Gervet. Conjunto: constraint logic programming with finite set domains. In M. Bruynooghe editor, Proc. Int'l Symposium on Logic Programming (ILPS'94), pages 339-358. The MIT Press, 1994.
12. M. R. Henzinger, T.A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. In 36th Annual Symposium on Foundations of Computer Science (FOCS'95), pages 453-462. IEEE Computer Society Press, 1995.
13. McMillan K.L. Symbolic mode checking: an approach to the state explosion problem. 1993;Kluwer Academic
14. Grumberg O., Long D.E. Model checking and modular verification. ACM Transactions on Programming Languages and systems. 16:(3):May 1994;843-871
15. C. Piazza and A. Policriti. Ackermann encoding, bisimulation, and obdd's In Proc. of Workshop on Verification and Computational Logic (VCL'01), 2001.