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 14 of 14 for “"Bisimulation"”.
-
Guarded logics : algorithms and bisimulation
… invariance under an appropriate variant of bisimulation, and other nice model theoretic properties including a decidable fixed-point extension. The goal of this this work is to gain greater insight into the correspondence between the modal world and the guarded world. In this process, …
-
Bisimulation as a verification and validation technique for message sequence charts
The complexity of determining whether a system meets the requirements of its designers has increased with the widespread use of real time concurrent systems. This testing process has however been simplified with the emergence of Formal Description Techniques. FDTs not only provide the means for …
-
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 …
-
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 …
-
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.
-
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 …
-
Finding presheaf models for the finite pi-calculus.
… for the finite pi-calculus with respect to late-bisimulation and late-equivalence relations. This is achieved by amalgamating the works by M. P. Fiore, E. Moggi and D. Sangiorgi, and I. Stark. In their respective works the authors construct categorical models, and define a meta-language in which …
-
Approximation Based Safety and Stability Verification of Hybrid Systems
… stability properties are not invariant under bisimulation which is a canonical transformation under which various discrete-time properties (including safety) are known to be invariant. We enrich bisimulation with uniform continuity conditions which suffice to preserve various stability …
-
On Games on Non-Wellfounded Sets and Stationary Sets
… sets can be determined by a so called bisimulation game already used to identify processes in theoretical computer science and possible world models for modal logic. Here we present a game to classify non-wellfounded sets according to their branching structure. We also study games on …
-
Coinductive program verification
… of ``coinduction up to'' developed for proving bisimulation) instead of the simplest statement of coinduction. We implement our approach in Coq, producing a certifying language-independent verification framework. The soundness of the system is based on a single module proving the necessary …
-
Calculus for decision systems
… for decision systems. This equivalence, called bisimulation, allows us to compare decision systems from the behavioral standpoint. We apply our results to games in extensive form, some physical systems, and cyber-physical systems. ^ Using the CDS for the study of games in extensive form we were …
-
Contributions to the theory of syntax with bindings and to process algebra
… building incrementally an a priori unknown bisimulation, and pattern-based, in that it works on equalities of process patterns (i.e., universally quantified equations of process terms containing process variables), thus taking advantage of equational reasoning in a ""circular"" manner, …
-
Implementing Mediators with Cheap Talk
… the mediator if $n > 4t$. Intuitively, $t$-bisimulation means that for any deviation performed by an adversary controlling at most $t$ players in the scenario with the mediator or in the scenario without the mediator there exists an equivalent deviation in the other scenario (i.e., a …
-
Behavioural Model Fusion
In large-scale model-based development, developers periodically need to combine collections of interrelated models. These models may capture different features of a system, describe alternative perspectives on a single feature, or express ways in which different features alter one another's …