An implementation of an efficient algorithm for bisimulation equivalence
From MaRDI portal
Publication:922711
DOI10.1016/0167-6423(90)90071-KzbMath0711.68058OpenAlexW1973642705MaRDI QIDQ922711
Publication date: 1990
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6423(90)90071-k
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation, Morphisms and Minimisation of Weighted Automata, Generating BDDs for symbolic model checking in CCS, Conflict-preserving abstraction of discrete event systems using annotated automata, Symbolic models for control systems, Divergent stutter bisimulation abstraction for controller synthesis with linear temporal logic specifications, Control protocol synthesis for multi-agent systems with similar actions instantiated from agent and requirement templates, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, A tableau construction for finite linear-time temporal logic, Essential transitions to bisimulation equivalences, A survey on compositional algorithms for verification and synthesis in supervisory control, Verifying chemical reaction network implementations: a bisimulation approach, Equivalence checking 40 years after: a review of bisimulation tools, Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains, Maximally permissive coordinated distributed supervisory control of nondeterministic discrete-event systems, Compositionality in state space verification methods, Deciding bisimilarity and similarity for probabilistic processes., Minimizing the number of transitions with respect to observation equivalence, Computing maximal weak and other bisimulations, Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking, COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA, Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types, Nonconflict check by using sequential automaton abstractions based on weak observation equivalence, On the computation of natural observers in discrete-event systems, Bisimilarity Minimization in O(m logn) Time, Game-theoretic simulation checking tool, Reduced-order observer design for fault diagnosis of Boolean control networks, Iterating transducers, Employing behavioral preorders to define controllability for nondeterministic discrete-event systems, Stepwise development of process-algebraic specifications in decorated trace semantics
