Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 65 for “"Bisimulation"”.

  1. Learning bisimulation

    Computational learning theory is a branch of theoretical computer science that re-imagines the role of an algorithm from an agent of computation to an agent of learning. The operations of computers become those of the human mind; an important step towards illuminating the limitations of artificial …

    uvic Repository record for Learning bisimulation (opens in a new tab)

  2. Controller Synthesis for Bisimulation Equivalence

    … thesis investigates the controller synthesis for bisimulation equivalence from both discrete and continuous aspects. From discrete perspective, supervisory control is studied to enforce bisimilarity for discrete event systems. Specifically, we consider three kinds of supervisory control problems: …

    nus Repository record for Controller Synthesis for Bisimulation Equivalence (opens in a new tab) Download file for Controller Synthesis for Bisimulation Equivalence (opens in a new tab)

  3. Bisimulation-based Structural Summaries of Large Graphs

    … explore, and query these large graphs. Bisimulation-based structural summaries have often been used as a compact representation of the dataset that can improve query performance. However, current bisimulation summary construction techniques for large graphs do not scale and do not …

    toronto-retro Repository record for Bisimulation-based Structural Summaries of Large Graphs (opens in a new tab)

  4. Stochastic transition systems: bisimulation, logic, and composition

    … respect to standard notions for simulation and bisimulation are presented for which the challenge is to prove the existence of appropriate couplings. In this context a theory for stochastic transition systems concerning simulation, bisimulation, and trace-distribution relations is developed. We …

    qucosa-diss

  5. Supervisory control of discrete event systems for bisimulation or simulation equivalence

    … and sequential behaviors and are captured using bisimulation equivalence (the traditional language equivalence only captures sequential behaviors). Simulation equivalence is more expressive than language equivalence but captures only the universal fragment of branching behaviors.;This …

    iastate Repository record for Supervisory control of discrete event systems for bisimulation or simulation equivalence (opens in a new tab)

  6. Generalized Synchronization Trees

    … -- provide a very natural setting for studying bisimulation and composition. In this thesis, we study both matters from a number of different perspectives: different notions of bisimulation over GSTs are defined and their (unexpected) semantic differences are established; the relationship of …

    maryland Repository record for Generalized Synchronization Trees (opens in a new tab)

  7. On modal characterisation theorems over finite structures with applications to graph neural networks

    Bisimulations capture a natural notion of equivalence for elements in relational structures, which was independently discovered in different areas of computer science. The relevance of bisimulations across fields naturally motivates the characterisation of the bisimulation-invariant fragments for …

    oxford Restricted access

  8. Improving scalability of exploratory model checking

    … combination by presenting novel algorithms for bisimulation reduction with respect to <em>strong bisimulation, divergence- respecting delay bisimulation</em>, and <em>divergence-respecting weak bisimulation</em>. Since a parallel composition is related to the Cartesian product of its components, …

    oxford Repository record for Improving scalability of exploratory model checking (opens in a new tab)

  9. Semantics-based program verification

    … equivalence. First, we propose a novel notion of bisimulation, which we call cut-bisimulation, allowing the two programs to semantically synchronize at relevant ""cut"" points, but to evolve independently otherwise. Employing the cut-bisimulation, we develop a language-independent equivalence …

    uiuc Repository record for Semantics-based program verification (opens in a new tab)

  10. Estimation, Diagnosis, and Control in Discrete Event Systems in the Presence of Observability Constraints and Faults

    … that the redundant Petri net controllers be bisimulation equivalent to the given, original controller (to retain identical control objectives). We obtain complete characterizations of redundant controllers along with necessary and sufficient conditions for bisimulation equivalence.

    uiuc Repository record for Estimation, Diagnosis, and Control in Discrete Event Systems in the Presence of Observability Constraints and Faults (opens in a new tab)

  11. Information flow security - models, verification and schedulers

    … level secrets from low level observation traces. Bisimulation-based properties express security as a low-level observational equivalence relation on states. In the literature, several distinct schools have developed frameworks for information flow security properties based on different semantic …

    unsw Repository record for Information flow security - models, verification and schedulers (opens in a new tab)

  12. On coalgebras and final semantics

    … the morphisms can be thought of as functional bisimulations. Thus, Coalg(T) is a suitable setting for a category-theoretic account of bisimulation and coinduction. We are particularly interested in final coalgebras, viewing them as strongly-extensional universal transition systems and as …

    oxford Repository record for On coalgebras and final semantics (opens in a new tab)

  13. Coherent minimisation: aggressive optimisation for symbolic finite state transducers

    … techniques are based on the notion of bisimulation to determine equivalent states which can be identified. Although minimisation of automata has been an established topic of research, the optimisation of automata works in constrained environments is a novel idea which we will examine in …

    birmingham Download PDF for Coherent minimisation: aggressive optimisation for symbolic finite state transducers (opens in a new tab)

  14. Translation validation for compilation verification

    … is a rigorous formalization, namely cut-bisimulation, for weak bisimulation variants that serve as a generalization of the various (sometimes ad-hoc) notions of program equivalence found in the literature. We develop a program equivalence checking algorithm that proves two programs …

    uiuc Repository record for Translation validation for compilation verification (opens in a new tab)

Page 1 of 4