Results 81 to 90 of about 13,172 (205)
Modelling the Embedded Control System Using iUML‐B Pattern State Machine
Developing the formal model based on the Event‐B design pattern is an excellent method to improve the development efficiency of the embedded control system and improve the reusability of the formal model. However, the instantiation of the Event‐B design pattern requires the manual writing of a large number of model codes, which brings a great deal of ...
Han Peng +4 more
wiley +1 more source
Bisimulation, games, and logic
In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically and logically in a non-interleaving model.
Nielsen, Mogens, Clausen, Christian
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sébastien Briais, Uwe Nestmann
openaire +2 more sources
On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions
Two resources (submarkings) are called similar if in any marking any one of them can be replaced by another one without affecting the observable behavior of the net (regarding marking bisimulation). It is known that resource similarity is undecidable for
Vladimir A. Bashkin
doaj +1 more source
Bisimulation Quotient in Inquisitive Modal Logic
Inquisitive modal logic InqML⊞ is a natural generalization of basic modal logic, with ⊞ as a primitive modal operator. In this paper, we study the bisimulation quotients in the logic InqML⊞.
Stipe Marić
doaj +1 more source
Compositionality of Approximate Bisimulation for Probabilistic Systems [PDF]
Probabilistic transition system specifications using the rule format ntmuft-ntmuxt provide structural operational semantics for Segala-type systems and guarantee that probabilistic bisimilarity is a congruence.
Daniel Gebler, Simone Tini
doaj +1 more source
Uniform Interpolation for Coalgebraic Fixpoint Logic [PDF]
We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely closure under ...
Marti, Johannes +2 more
core +3 more sources
Generalized Bisimulation Metrics [PDF]
The bisimilarity pseudometric based on the Kantorovich lifting is one of the most popular metrics for probabilistic processes proposed in the literature. However, its application in verification is limited to linear properties. We propose a generalization of this metric which allows to deal with a wider class of properties, such as those used in ...
Chatzikokolakis, Konstantinos +3 more
openaire +1 more source
Logical Characterization of Bisimulation Metrics [PDF]
Bisimulation metrics provide a robust and accurate approach to study the behavior of nondeterministic probabilistic processes. In this paper, we propose a logical characterization of bisimulation metrics based on a simple probabilistic variant of the ...
Valentina Castiglioni +2 more
doaj +1 more source
Words and bisimulations of dynamical systems [PDF]
In this paper we study bisimulations on dynamical systems through a given partition. Our aim is to give a new vision of the notion of bisimulation by using words.
Thomas Brihaye
doaj +2 more sources

