Log in

Relevant bibliographies by topics / Approximate bisimulation / Journal articles

To see the other types of publications on this topic, follow the link: Approximate bisimulation.

Journal articles on the topic 'Approximate bisimulation'

Author: Grafiati

Published: 11 March 2023

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 39 journal articles for your research on the topic 'Approximate bisimulation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Ma, Yanfang. "Quantitative Analysis of Software Approximate Correctness." Mathematical Problems in Engineering 2015 (2015): 1–13. http://dx.doi.org/10.1155/2015/173012.

Full text

Abstract:

Parameterized bisimulation provides an abstract description of software correctness. In real world situations, however, many software products are approximately correct. To characterize the approximate correctness, we generalize the parameterized bisimulation to numerical version and probabilistic setting. First, we propose the definition of the parameterized bisimulation index that expresses the degree to which a binary relation is parameterized bisimulation. Then,λ-parameterized bisimulation over environmenteand its substitutivity laws are presented. Finally,λ-parameterized probabilistic bis

APA, Harvard, Vancouver, ISO, and other styles

2

Deng, Hui, and Jinzhao Wu. "Approximate Bisimulation and Optimization of Software Programs Based on Symbolic-Numeric Computation." Mathematical Problems in Engineering 2013 (2013): 1–19. http://dx.doi.org/10.1155/2013/421926.

Full text

Abstract:

To achieve behavior and structure optimization for a type of software program whose data exchange processes are represented by nonlinear polynomial systems, this paper establishes a novel formal description called a nonlinear polynomial transition system to represent the behavior and structure of the software program. Then, the notion of bisimulation for software programs is proposed based on the equivalence relation of corresponding nonlinear polynomial systems in their nonlinear polynomial transition systems. However, the exact equivalence is too strict in application. To enhance the flexibi

APA, Harvard, Vancouver, ISO, and other styles

3

Yang, Chao, and Yongming Li. "Approximate bisimulation relations for fuzzy automata." Soft Computing 22, no. 14 (2017): 4535–47. http://dx.doi.org/10.1007/s00500-017-2913-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Liu, Bai, Jinzhao Wu, and Zhucheng Xie. "Approximate Bisimulation Equivalence and Variable Refinement." Applied Mathematics & Information Sciences 8, no. 4 (2014): 1959–66. http://dx.doi.org/10.12785/amis/080454.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gebler, Daniel, and Simone Tini. "Compositionality of Approximate Bisimulation for Probabilistic Systems." Electronic Proceedings in Theoretical Computer Science 120 (July 26, 2013): 32–46. http://dx.doi.org/10.4204/eptcs.120.4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Girard, Antoine, and George J. Pappas. "Approximate bisimulation relations for constrained linear systems." Automatica 43, no. 8 (2007): 1307–17. http://dx.doi.org/10.1016/j.automatica.2007.01.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Girard, Antoine. "Low-complexity quantized switching controllers using approximate bisimulation." Nonlinear Analysis: Hybrid Systems 10 (November 2013): 34–44. http://dx.doi.org/10.1016/j.nahs.2013.02.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Chao, Jinzhao Wu, Hongyan Tan, and Jun Fu. "Approximate reachability and bisimulation equivalences for transition systems." Transactions of Tianjin University 22, no. 1 (2016): 19–23. http://dx.doi.org/10.1007/s12209-016-2565-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

CHOE, Sunseong, Kunihiko HIRAISHI, and Koichi KOBAYASHI. "Approximate Bisimulation for Hybrid Systems Based on Transition Relations." Transactions of the Society of Instrument and Control Engineers 47, no. 12 (2011): 614–20. http://dx.doi.org/10.9746/sicetr.47.614.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Stankovic, Aleksandar M., Savo D. Dukic, and Andrija T. Saric. "Approximate Bisimulation-Based Reduction of Power System Dynamic Models." IEEE Transactions on Power Systems 30, no. 3 (2015): 1252–60. http://dx.doi.org/10.1109/tpwrs.2014.2342504.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Ma, Yanfang, та Haiyu Pan. "The Approximate Correctness of Systems Based on δ -bisimulation". Electronic Notes in Theoretical Computer Science 333 (вересень 2017): 73–87. http://dx.doi.org/10.1016/j.entcs.2017.08.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Girard, Antoine. "Controller synthesis for safety and reachability via approximate bisimulation." Automatica 48, no. 5 (2012): 947–53. http://dx.doi.org/10.1016/j.automatica.2012.02.037.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Girard, Antoine, and George J. Pappas. "Approximate Bisimulation: A Bridge Between Computer Science and Control Theory." European Journal of Control 17, no. 5-6 (2011): 568–78. http://dx.doi.org/10.3166/ejc.17.568-578.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Deng, Hui, Jinzhao Wu, and Hongyan Tan. "Approximate Bisimulation for High-Level Datapaths in Intelligent Transportation Systems." Advances in Mechanical Engineering 5 (January 2013): 305636. http://dx.doi.org/10.1155/2013/305636.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Ariful Islam, Md, Abhishek Murthy, Ezio Bartocci, et al. "Model-order reduction of ion channel dynamics using approximate bisimulation." Theoretical Computer Science 599 (September 2015): 34–46. http://dx.doi.org/10.1016/j.tcs.2014.03.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Hu, Wujie, and Jinzhao Wu. "BSIN: A Behavior Schema of Information Networks Based on Approximate Bisimulation." Tsinghua Science and Technology 29, no. 4 (2024): 1092–104. http://dx.doi.org/10.26599/tst.2023.9010081.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Pola, Giordano, Pierdomenico Pepe, and Maria Domenica Di Benedetto. "Symbolic models for time-varying time-delay systems via alternating approximate bisimulation." International Journal of Robust and Nonlinear Control 25, no. 14 (2014): 2328–47. http://dx.doi.org/10.1002/rnc.3204.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Qiao, Sha, and Ping Zhu. "Limited approximate bisimulations and the corresponding rough approximations." International Journal of Approximate Reasoning 130 (March 2021): 50–82. http://dx.doi.org/10.1016/j.ijar.2020.12.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Pola, Giordano, and Paulo Tabuada. "Symbolic Models for Nonlinear Control Systems: Alternating Approximate Bisimulations." SIAM Journal on Control and Optimization 48, no. 2 (2009): 719–33. http://dx.doi.org/10.1137/070698580.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Pola, Giordano, Pierdomenico Pepe, Maria D. Di Benedetto, and Paulo Tabuada. "Symbolic models for nonlinear time-delay systems using approximate bisimulations." Systems & Control Letters 59, no. 6 (2010): 365–73. http://dx.doi.org/10.1016/j.sysconle.2010.04.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Delgrange, Florent, Ann Nowé, and Guillermo A. Pérez. "Distillation of RL Policies with Formal Guarantees via Variational Abstraction of Markov Decision Processes." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 6 (2022): 6497–505. http://dx.doi.org/10.1609/aaai.v36i6.20602.

Full text

Abstract:

We consider the challenge of policy simplification and verification in the context of policies learned through reinforcement learning (RL) in continuous environments. In well-behaved settings, RL algorithms have convergence guarantees in the limit. While these guarantees are valuable, they are insufficient for safety-critical applications. Furthermore, they are lost when applying advanced techniques such as deep-RL. To recover guarantees when applying advanced RL algorithms to more complex environments with (i) reachability, (ii) safety-constrained reachability, or (iii) discounted-reward obje

APA, Harvard, Vancouver, ISO, and other styles

22

Yang, Chao, and Yongming Li. "Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures." Fuzzy Sets and Systems 391 (July 2020): 72–95. http://dx.doi.org/10.1016/j.fss.2019.07.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

HONSELL, FURIO, and MARINA LENISA. "Coinductive characterizations of applicative structures." Mathematical Structures in Computer Science 9, no. 4 (1999): 403–35. http://dx.doi.org/10.1017/s096012959900287x.

Full text

Abstract:

We discuss new ways of characterizing, as maximal fixed points of monotone operators, observational congruences on λ-terms and, more generally, equivalences on applicative structures. These characterizations naturally induce new forms of coinduction principles for reasoning on program equivalences, which are not based on Abramsky's applicative bisimulation. We discuss, in particular, what we call the cartesian coinduction principle, which arises when we exploit the elementary observation that functional behaviours can be expressed as cartesian graphs. Using the paradigm of final semantics, the

APA, Harvard, Vancouver, ISO, and other styles

24

Li, Ping, Jufang Yang, Yongming Li, Chao Yang, and Wenyu Xue. "Algebraic properties of approximate bisimulation relations for fuzzy automata." Fuzzy Sets and Systems, January 2025, 109278. https://doi.org/10.1016/j.fss.2025.109278.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Ruan, Sherry, Gheorghe Comanici, Prakash Panangaden, and Doina Precup. "Representation Discovery for MDPs Using Bisimulation Metrics." Proceedings of the AAAI Conference on Artificial Intelligence 29, no. 1 (2015). http://dx.doi.org/10.1609/aaai.v29i1.9747.

Full text

Abstract:

We provide a novel, flexible, iterative refinement algorithm to automatically construct an approximate statespace representation for Markov Decision Processes (MDPs). Our approach leverages bisimulation metrics, which have been used in prior work to generate features to represent the state space of MDPs.We address a drawback of this approach, which is the expensive computation of the bisimulation metrics. We propose an algorithm to generate an iteratively improving sequence of state space partitions. Partial metric computations guide the representation search and provide much lower space and c

APA, Harvard, Vancouver, ISO, and other styles

26

Ruan, Sherry, Gheorghe Comanici, Prakash Panangaden, and Doina Precup. "Representation Discovery for MDPs Using Bisimulation Metrics." Proceedings of the AAAI Conference on Artificial Intelligence 29, no. 1 (2015). http://dx.doi.org/10.1609/aaai.v29i1.9701.

Full text

Abstract:

We provide a novel, flexible, iterative refinement algorithm to automatically construct an approximate statespace representation for Markov Decision Processes (MDPs). Our approach leverages bisimulation metrics, which have been used in prior work to generate features to represent the state space of MDPs. We address a drawback of this approach, which is the expensive computation of the bisimulation metrics. We propose an algorithm to generate an iteratively improving sequence of state space partitions. Partial metric computations guide the representation search and provide much lower space and

APA, Harvard, Vancouver, ISO, and other styles

27

Wang, Fujun, Zining Cao, Lixing Tan, and Zhen Li. "Formal Modeling and Performance Evaluation for Hybrid Systems: A Probabilistic Hybrid Process Algebra-Based Approach." International Journal of Software Engineering and Knowledge Engineering, April 4, 2022, 1–33. http://dx.doi.org/10.1142/s0218194022500103.

Full text

Abstract:

Probabilistic behavior is omnipresent in computer-controlled systems, in particular, so-called safety-critical hybrid systems, due to various reasons, like uncertain environments or fundamental properties of nature. In this paper, we extend the existing hybrid process algebra ACP[Formula: see text] with probability without sacrificing the nondeterministic choice operator. The existing approximate probabilistic bisimulation relation is fragile and not robust in the sense of being dependent on the deviation range of the transition probability. To overcome this defect, a novel approximate probabi

APA, Harvard, Vancouver, ISO, and other styles

28

Boreale, Michele. "Algebra, coalgebra, and minimization in polynomial differential equations." Logical Methods in Computer Science Volume 15, Issue 1 (February 15, 2019). https://doi.org/10.23638/lmcs-15(1:14)2019.

Full text

Abstract:

We consider reasoning and minimization in systems of polynomial ordinary differential equations (ode's). The ring of multivariate polynomials is employed as a syntax for denoting system behaviours. We endow this set with a transition system structure based on the concept of Lie-derivative, thus inducing a notion of L-bisimulation. We prove that two states (variables) are L-bisimilar if and only if they correspond to the same solution in the ode's system. We then characterize L-bisimilarity algebraically, in terms of certain ideals in the polynomial ring that are invariant under Lie-derivation.

APA, Harvard, Vancouver, ISO, and other styles

29

Sprunger, David, Shin-ya Katsumata, Jérémy Dubut, and Ichiro Hasuo. "Fibrational bisimulations and quantitative reasoning: Extended version." Journal of Logic and Computation, September 10, 2021. http://dx.doi.org/10.1093/logcom/exab051.

Full text

Abstract:

Abstract Bisimulation and bisimilarity are fundamental notions in comparing state-based systems. Their extensions to a variety of systems have been actively pursued in recent years, a notable direction being quantitative extensions. In this paper we enhance a categorical framework for such extended (bi)simulation notions. We use coalgebras as system models and fibrations for organizing predicates—following the seminal work by Hermida and Jacobs. Endofunctor liftings are crucial predicate-forming ingredients; the first contribution of this work is to extend several extant lifting techniques fro

APA, Harvard, Vancouver, ISO, and other styles

30

Cuartas, Jaime, David Cortés, Joan Betancourt, et al. "MUPPAAL: Efficient Elimination and Reduction of Useless Mutants in Real‐Time Model‐Based Systems." Software Testing, Verification and Reliability, November 12, 2024. http://dx.doi.org/10.1002/stvr.1907.

Full text

Abstract:

ABSTRACTTo assess test quality, mutation testing (MT) creates mutants by injecting artificial faults into the system and evaluates the ability of tests to distinguish these mutants. Tests distinguishing more mutants have also been proven empirically to detect more real faults. MT has been applied to many domains. We focus on MT for timed safety‐critical systems modelled as Timed Automata (TA). While powerful, MT usually yields equivalent and duplicate mutants, the former having the same behaviour as the original system and the latter other mutants. Such useless mutants bring no value, waste ex

APA, Harvard, Vancouver, ISO, and other styles

31

Behr, Nicolas, Vincent Danos, and Ilias Garnier. "Combinatorial Conversion and Moment Bisimulation for Stochastic Rewriting Systems." Logical Methods in Computer Science Volume 16, Issue 3 (July 10, 2020). https://doi.org/10.23638/lmcs-16(3:3)2020.

Full text

Abstract:

We develop a novel method to analyze the dynamics of stochastic rewriting systems evolving over finitary adhesive, extensive categories. Our formalism is based on the so-called rule algebra framework and exhibits an intimate relationship between the combinatorics of the rewriting rules (as encoded in the rule algebra) and the dynamics which these rules generate on observables (as encoded in the stochastic mechanics formalism). We introduce the concept of combinatorial conversion, whereby under certain technical conditions the evolution equation for (the exponential generating function of) the

APA, Harvard, Vancouver, ISO, and other styles

32

Qiao, Sha, Ping Zhu, and Witold Pedrycz. "Approximate bisimulations for fuzzy-transition systems." Fuzzy Sets and Systems, May 2023, 108533. http://dx.doi.org/10.1016/j.fss.2023.108533.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Yang, Chao, Ruiling Wu, Xiaobing Sun, Qichao Wang, and Yongming Li. "Relative approximate bisimulations for fuzzy picture automata." Information and Computation, May 2024, 105172. http://dx.doi.org/10.1016/j.ic.2024.105172.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Bartoletti, Massimo, Maurizio Murgia, and Roberto Zunino. "Sound approximate and asymptotic probabilistic bisimulations for PCTL." Logical Methods in Computer Science Volume 19, Issue 1 (March 31, 2023). http://dx.doi.org/10.46298/lmcs-19(1:22)2023.

Full text

Abstract:

We tackle the problem of establishing the soundness of approximate bisimilarity with respect to PCTL and its relaxed semantics. To this purpose, we consider a notion of bisimilarity inspired by the one introduced by Desharnais, Laviolette, and Tracol, and parametric with respect to an approximation error $\delta$, and to the depth $n$ of the observation along traces. Essentially, our soundness theorem establishes that, when a state $q$ satisfies a given formula up-to error $\delta$ and steps $n$, and $q$ is bisimilar to $q'$ up-to error $\delta'$ and enough steps, we prove that $q'$ also satis

APA, Harvard, Vancouver, ISO, and other styles

35

Micić, Ivana, Linh Anh Nguyen, and Stefan Stanimirović. "Characterization and computation of approximate bisimulations for fuzzy automata." Fuzzy Sets and Systems, May 2022. http://dx.doi.org/10.1016/j.fss.2022.05.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Stanimirovic, Stefan, Ivana Micic, and Miroslav Ciric. "Approximate Bisimulations for Fuzzy Automata over Complete Heyting Algebras." IEEE Transactions on Fuzzy Systems, 2020, 1. http://dx.doi.org/10.1109/tfuzz.2020.3039968.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Micić, Ivana, Miroslav Ćirić, Jelena Matejić, Stefan Stanimirović, and Linh Anh Nguyen. "Approximate weak simulations and bisimulations for fuzzy automata over the product structure." Fuzzy Sets and Systems, March 2024, 108959. http://dx.doi.org/10.1016/j.fss.2024.108959.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Stanković, Marko, Miroslav Ćirić, Stefan Stanimirović, and Đorđe Stakić. "Approximate Bisimulations for Kripke models of Fuzzy Multimodal Logics Over Complete Heyting Algebras." Fuzzy Sets and Systems, February 2025, 109299. https://doi.org/10.1016/j.fss.2025.109299.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Lanotte, Ruggero, Massimo Merro, and Simone Tini. "Equational Reasonings in Wireless Network Gossip Protocols." Logical Methods in Computer Science Volume 14, Issue 3 (September 28, 2018). https://doi.org/10.23638/lmcs-14(3:24)2018.

Full text

Abstract:

Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout large-scale networks. In this paper, we propose a compositional analysis technique to study formal probabilistic models of gossip protocols expressed in a simple probabilistic timed process calculus for wireless sensor networks. We equip the calculus with a simulation theory to compare probabilistic protocols that have similar behaviour up to a certain tolerance. The theory is used to prove a number of algebraic laws which revealed to be very effective to estimate the performances of g

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!