Results 1 to 10 of about 13,103 (138)
SOS rule formats for convex and abstract probabilistic bisimulations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Probabilistic transition system specifications (PTSSs) in the ntμfθ/ntμxθ format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that bisimilarity is a ...
Pedro R. D'Argenio +2 more
doaj +7 more sources
A Logic with Reverse Modalities for History-preserving Bisimulations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We introduce event identifier logic (EIL) which extends Hennessy-Milner logic by the addition of (1) reverse as well as forward modalities, and (2) identifiers to keep track of events. We show that this logic corresponds to hereditary history-preserving (
Irek Ulidowski, Iain Phillips
doaj +4 more sources
A Definition Scheme for Quantitative Bisimulation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as continuous-time Markov chains, interactive Markov chains, and Markov automata.
Diego Latella +2 more
doaj +4 more sources
Bisimulation of Labeled State-to-Function Transition Systems of Stochastic Process Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Labeled state-to-function transition systems, FuTS for short, admit multiple transition schemes from states to functions of finite support over general semirings.
D. Latella, M. Massink, E.P. de Vink
doaj +7 more sources
Strong, Weak and Branching Bisimulation for Transition Systems and Markov Reward Chains: A Unifying Matrix Approach [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 We first study labeled transition systems with explicit successful termination. We establish the notions of strong, weak, and branching bisimulation in terms of boolean matrix theory, introducing thus a novel and powerful algebraic apparatus.
Nikola Trčka
doaj +5 more sources
Equivalence of switching linear systems by bisimulation [PDF]
, 2006 A general notion of hybrid bisimulation is proposed for the class of switching linear systems. Connections between the notions of bisimulation-based equivalence, state-space equivalence, algebraic and input–output equivalence are investigated.
A. J. van der Schaft +27 more
core +19 more sources
Relating Apartness and Bisimulation [PDF]
Logical Methods in Computer Science, 2021 A bisimulation for a coalgebra of a functor on the category of sets can be described via a coalgebra in the category of relations, of a lifted functor.
Herman Geuvers, Bart Jacobs
doaj +1 more source
On Context Bisimulation for Parameterized Higher-order Processes [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper studies context bisimulation for higher-order processes, in the presence of parameterization (viz. abstraction). We show that the extension of higher-order processes with process parameterization retains the characterization of context ...
Xian Xu
doaj +1 more source
Coherent branching feature bisimulation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Progress in the behavioral analysis of software product lines at the family level benefits from further development of the underlying semantical theory. Here, we propose a behavioral equivalence for feature transition systems (FTS) generalizing branching
Tessa Belder +2 more
doaj +1 more source
Scalable Minimization Algorithm for Partial Bisimulation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We present an efficient algorithm for computing the partial bisimulation preorder and equivalence for labeled transitions systems. The partial bisimulation preorder lies between simulation and bisimulation, as only a part of the set of actions is ...
J. Markovski
doaj +1 more source