Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Design and validation of computer protocols
Design and validation of computer protocols
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
Online minimization of transition systems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A classical mind
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
High performance BDD package by exploiting memory hierarchy
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Vicious circles: on the mathematics of non-wellfounded phenomena
Vicious circles: on the mathematics of non-wellfounded phenomena
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
IEEE Transactions on Software Engineering
Model checking
Set theory for computing: from decision procedures to declarative programming with sets
Set theory for computing: from decision procedures to declarative programming with sets
Symbolic Model Checking
Operational and abstract semantics of the query language G-Log
Theoretical Computer Science
Computing strongly connected components in a linear number of symbolic steps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing Interacting Finite State Machines: A Compositional Approach to Language to Containment
ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Simulation as Coarsest Partition Problem
TACAS '02 Proceedings of the 8th 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
XEVE, an ESTEREL Verification Environment
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Symbolic Bisimulation Minimisation
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Bounded Hyperset Theory and Web-like Data Bases
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Access control enforcement for conversation-based web services
Proceedings of the 15th international conference on World Wide Web
Theory and Practice of Logic Programming
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
New Bisimulation Semantics for Distributed Systems
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Applying model-checking to solve queries on semistructured data
Computer Languages, Systems and Structures
Bisimilarity Minimization in O(m logn) Time
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Hyperset Approach to Semi-structured Databases
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
Optimizing Pointer Analysis Using Bisimilarity
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
An efficient simulation algorithm based on abstract interpretation
Information and Computation
Filling Out the Gaps: A Padding Algorithm for Transforming Out Timing Leaks
Electronic Notes in Theoretical Computer Science (ENTCS)
Referring expressions as formulas of description logic
INLG '08 Proceedings of the Fifth International Natural Language Generation Conference
An incremental bisimulation algorithm
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Exploring XML web collections with DescribeX
ACM Transactions on the Web (TWEB)
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Optimizing incremental maintenance of minimal bisimulation of cyclic graphs
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Computing the maximum bisimulation with spiking neural P systems
Computation, cooperation, and life
Using logic in the generation of referring expressions
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
A fully symbolic bisimulation algorithm
RP'11 Proceedings of the 5th international conference on Reachability problems
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Reasoning, Action and Interaction in AI Theories and Systems
Summarizing XML data by means of association rules
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
ExpLOD: summary-based exploration of interlinking and RDF usage in the linked open data cloud
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
Minimization of non-deterministic automata with large alphabets
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Efficient external-memory bisimulation on DAGs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Saving Space in a Time Efficient Simulation Algorithm
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Fast answering of XPath query workloads on web collections
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
Rough set analysis of relational structures
Information Sciences: an International Journal
Ranking, unranking and random generation of extensional acyclic digraphs
Information Processing Letters
A graph-theoretic approach to map conceptual designs to XML schemas
ACM Transactions on Database Systems (TODS)
Large-scale bisimulation of RDF graphs
Proceedings of the Fifth Workshop on Semantic Web Information Management
External memory K-bisimulation reduction of big graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Efficient computation of program equivalence for confluent concurrent constraint programming
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Bisimulation reduction of big graphs on mapreduce
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
| Hi-index | 5.23 |
We propose an efficient algorithmic solution to the problem of determining a Bisimulation Relation on a finite structure working both on the explicit and on the implicit (symbolic) representation. As far as the explicit case is concerned, starting from a set-theoretic point of view we propose an algorithm that optimizes the solution to the Relational Coarsest Partition Problem given by Paige and Tarjan (SIAM J. Comput. 16(6) (1987) 973); its use in model-checking packages is also discussed and tested. For well-structured graphs our algorithm reaches a linear worst-case behaviour. The proposed algorithm is then re-elaborated to produce a symbolic version.