scientific article; zbMATH DE number 1306878

Peter W. Kopke, Monika R. Henzinger, Thomas A. Henzinger

Publication date: 26 April 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

An Algorithm for Probabilistic Alternating Simulation, An efficient algorithm for computing bisimulation equivalence, A space-efficient simulation algorithm on probabilistic automata, Abstraction and Abstraction Refinement, Process Algebra and Model Checking, Computing Stuttering Simulations, Comparative branching-time semantics for Markov chains, Effective reductions of Mealy machines, Strong simulation, Axiomatisation of general concept inclusions from finite interpretations, Simulation relations for fault-tolerance, Subgraph matching on temporal graphs, Simulation relations and applications in formal methods, A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation Equivalence, Distributed graph pattern matching via bounded dual simulation, Parallel algorithms for flexible pattern matching on big graphs, Latticed Simulation Relations and Games, State equivalences for rectangular hybrid automata, Verifying abstractions of timed systems, Better automata through process algebra, Equivalence checking 40 years after: a review of bisimulation tools, Word equations in synergy with regular constraints, Correcting a Space-Efficient Simulation Algorithm, Rewriting-based repairing strategies for XML repositories, Rewriting XPath queries using materialized XPath views, Consistency and refinement for interval Markov chains, Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation, Hardness of preorder checking for basic formalisms, Generalizing the Paige-Tarjan algorithm by abstract interpretation, Quantifying conformance using the Skorokhod metric, A Space-Efficient Probabilistic Simulation Algorithm, An efficient simulation algorithm on Kripke structures, Exploring the tractability border in epistemic tasks, Deciding bisimilarity and similarity for probabilistic processes., Polynomial time decision algorithms for probabilistic automata, Satisfiability and reasoning mechanism of terminological cycles in description logic \(v\mathcal L\), Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation, Star-topology decoupled state space search, Abstractions for hybrid systems, An O(m log n) algorithm for branching bisimilarity on labelled transition systems, Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm, Fair simulation, Bridging the gap between fair simulation and trace inclusion, Investigating single-type structural elements of a component Petri net during component modeling and analysis of a complex system with parallelism, Tree regular model checking: a simulation-based approach, Five Determinisation Algorithms, Computing Simulations over Tree Automata, Controller synthesis for bisimulation equivalence, Abstraction refinement and antichains for trace inclusion of infinite state systems, CEGAR for compositional analysis of qualitative properties in Markov decision processes, Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes, Advanced Ramsey-Based Büchi Automata Inclusion Testing, Property Driven Three-Valued Model Checking on Hybrid Automata, Approximated Reachability on Hybrid Automata: Falsification meets Certification, Probabilistic weak simulation is decidable in polynomial time, Game-theoretic simulation checking tool, An efficient simulation algorithm based on abstract interpretation, Fair simulation, Employing behavioral preorders to define controllability for nondeterministic discrete-event systems