An efficient algorithm for computing bisimulation equivalence
From MaRDI portal
Publication:1884935
DOI10.1016/S0304-3975(03)00361-XzbMath1070.68101MaRDI QIDQ1884935
Carla Piazza, Agostino Dovier, Alberto Policriti
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Minimality Notions via Factorization Systems and Examples, Fuzzy approximations of fuzzy relational structures, Unnamed Item, BISIMULATIONS FOR KNOWING HOW LOGICS, On the relations between Markov chain lumpability and reversibility, A space-efficient algorithm for finding strongly connected components, Characterization and computation of approximate bisimulations for fuzzy automata, On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, Lowerbounds for Bisimulation by Partition Refinement, On the expressiveness and decidability of higher-order process calculi, Equivalence checking 40 years after: a review of bisimulation tools, Bisimulations for fuzzy automata, Nondeterministic automata: equivalence, bisimulations, and uniform relations, Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains, Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures, HYPE: hybrid modelling by composition of flows, From generic partition refinement to weighted tree automata minimization, Computing the Maximum Bisimulation with Spiking Neural P Systems, Computing maximal weak and other bisimulations, Applying model-checking to solve queries on semistructured data, Computation of the greatest simulations and bisimulations between fuzzy automata, Set graphs. II. Complexity of set graph recognition and similar problems, Fuzzy relation equations and reduction of fuzzy automata, Reduction of fuzzy automata by means of fuzzy quasi-orders, Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences, New Bisimulation Semantics for Distributed Systems, Is hyper-extensionality preservable under deletions of graph elements?, An Incremental Bisimulation Algorithm, Bisimulation of type 2 for BL-general fuzzy automata, Bisimilarity Minimization in O(m logn) Time, Optimizing Pointer Analysis Using Bisimilarity, AN EFFICIENT FULLY SYMBOLIC BISIMULATION ALGORITHM FOR NON-DETERMINISTIC SYSTEMS, Efficient Coalgebraic Partition Refinement, Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
Uses Software
Cites Work
- Symbolic bisimulations
- CCS expressions, finite state processes, and three problems of equivalence
- A linear time solution to the single function coarsest partition problem
- Hypersets
- Operational and abstract semantics of the query language G-Log
- A minimized automaton representation of reachable states
- Checking noninterference in timed CSP
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- Graph-Based Algorithms for Boolean Function Manipulation
- Three Partition Refinement Algorithms
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
- A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
- Rank-Based Symbolic Bisimulation
- Depth-First Search and Linear Graph Algorithms
- Computer aided verification. 10th international conference, CAV'98, Vancouver, BC, Canada, June 28 -- July 2, 1998. Proceedings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
