An Efficient Fully Symbolic Bisimulation Algorithm for Non-Deterministic Systems

International Journal of Foundations of Computer Science- Singapore

doi 10.1142/s012905411340011x

Full Text

Abstract

Available in

Date

Authors

Publisher

World Scientific Pub Co Pte Lt

Related search

Partitioning Arrangements of Lines I: An Efficient Deterministic Algorithm

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1990English

An Efficient Thinning Algorithm for Arabic OCR Systems

Signal & Image Processing : An International Journal
2012English

An Efficient Rescaled Perceptron Algorithm for Conic Systems

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2009English

A Symbolic Algorithm for the Computation of Periodic Orbits in Non–Linear Differential Systems

Journal of Advances in Applied Mathematics
2016English

Weak Bisimulation for Probabilistic Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

New Bisimulation Semantics for Distributed Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007Indonesian

An Efficient Implementation of Non Symmetric Lanczos Algorithm,

1995English

An Efficient DOA Estimation Algorithm for Smart Antenna Systems in Multipath Environment

Information Technology Journal
2013Breton

A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems

International Journal of Foundations of Computer Science
Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy