Bibliografías temáticas / Approximate bisimulation

Índice

  1. Artículos de revistas
  2. Tesis
  3. Libros
  4. Capítulos de libros
  5. Actas de conferencias

Literatura académica sobre el tema "Approximate bisimulation"

Autor: Grafiati
Publicado: 11 de marzo de 2023
Última modificación: 31 de julio de 2025

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Approximate bisimulation".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Approximate bisimulation"

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.

Texto completo
Resumen
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
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Resumen
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
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Tesis sobre el tema "Approximate bisimulation"

1

Savo, Đukić. "Redukcija dinamičkih modela elektroenergetskog sistema primenom teorije balansnih realizacija i aproksimativnih bisimulacionih relacija i funkcija." Phd thesis, Univerzitet u Novom Sadu, Fakultet tehničkih nauka u Novom Sadu, 2014. http://dx.doi.org/10.2298/NS20131213DJUKIC.

Texto completo
Resumen
Disertacijom su opisane postojeće tehnike redukcije dinamičkih modela koje se koriste u teoriji upravljanja i postojeće tehnike za redukciju dinamičkih modela i ekvivalentiranje elektroenergetskih sistema. Predložen je nov pristup na fizici problema zasnovanoj redukciji dinamičkog modela elektroenergetskog sistema korišćenjem teorije balansnih realizacija. Takođe se predlaže korišćenje aproksimativnih bisimulacionih relacija za redukciju dinamičkih modela elektroenergetskog sistema. Postojeće tehnike i predloženi pristupi i algoritmi su primenjeni za redukciju dinamičkih modela dva razmatrana
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

PANAROTTO, Federica. "Measures on probabilistic automata." Doctoral thesis, 2017. http://hdl.handle.net/11562/913985.

Texto completo
Resumen
In questa tesi consideriamo i processi probabilistici non-deterministici modellati attraverso automi. Il nostro obiettivo \`e l'analisi dei problemi di bisimulazioni approssimate. Queste relazioni sono usate, generalmente, per semplificare i modelli di alcuni sistemi e per modellare agenti e attaccanti nei protocolli di sicurezza. In questo ultimo campo ci sono diversi proposte di utilizzo di metriche, le quali sono l'analogo quantitativo della bisimulazione probabilistica e permettono una miglior precisione. Una metrica \`e grossomodo un grado di similarit\`a tra stati. Iniziando dalla formal
Los estilos APA, Harvard, Vancouver, ISO, etc.

Libros sobre el tema "Approximate bisimulation"

1

Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs. Springer New York, 2001.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.

Capítulos de libros sobre el tema "Approximate bisimulation"

1

Spork, Timm, Christel Baier, Joost-Pieter Katoen, Sascha Klüppelholz, and Jakob Piribauer. "Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-98679-6_3.

Texto completo
Resumen
Abstract We introduce $$(\varepsilon , \delta )$$ ( ε , δ ) -bisimulation, a novel type of approximate probabilistic bisimulation for continuous-time Markov chains. In contrast to related notions, $$(\varepsilon , \delta )$$ ( ε , δ ) -bisimulation allows the use of different tolerances for the transition probabilities ( $$\varepsilon $$ ε , additive) and total exit rates ( $$\delta $$ δ , multiplicative) of states. Fundamental properties of the notion, as well as bounds on the absolute difference of time- and reward-bounded reachability probabilities for $$(\varepsilon ,\delta )$$ ( ε , δ ) -
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Yan, Gaogao, Li Jiao, Yangjia Li, Shuling Wang, and Naijun Zhan. "Approximate Bisimulation and Discretization of Hybrid CSP." In FM 2016: Formal Methods. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48989-6_43.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Bian, Gaoang, and Alessandro Abate. "On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-54458-7_19.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Harwood, Will, Faron Moller, and Anton Setzer. "Weak Bisimulation Approximants." In Computer Science Logic. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11874683_24.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Murthy, Abhishek, Md Ariful Islam, Ezio Bartocci, et al. "Approximate Bisimulations for Sodium Channel Dynamics." In Computational Methods in Systems Biology. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33636-2_16.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Wild, Paul, and Lutz Schröder. "A Quantified Coalgebraic van Benthem Theorem." In Lecture Notes in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71995-1_28.

Texto completo
Resumen
AbstractThe classical van Benthem theorem characterizes modal logic as the bisimulation-invariant fragment of first-order logic; put differently, modal logic is as expressive as full first-order logic on bisimulation-invariant properties. This result has recently been extended to two flavours of quantitative modal logic, viz. fuzzy modal logic and probabilistic modal logic. In both cases, the quantitative van Benthem theorem states that every formula in the respective quantitative variant of first-order logic that is bisimulation-invariant, in the sense of being nonexpansive w.r.t. behavioural
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Liu, Yucheng. "$$\epsilon $$-Approximate Bisimulations for Nondeterministic Fuzzy Kripke Structures." In Communications in Computer and Information Science. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-7743-7_7.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Abate, Alessandro, Marta Kwiatkowska, Gethin Norman, and David Parker. "Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations." In Lecture Notes in Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-06880-0_2.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Stanimirović, Stefan, Ivana Micić, and Linh Anh Nguyen. "On Relationships Between Approximate Bisimulations for Fuzzy Graphs and Their Approximation Degrees." In Fuzzy Logic and Technology, and Aggregation Operators. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-39965-7_48.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.

Actas de conferencias sobre el tema "Approximate bisimulation"

1

Chen, Jie, Zihao Mo, Tao Wang, and Weiming Xiang. "Approximate Bisimulation Relation Restoration for Neural Networks Based On Knowledge Distillation." In 2024 International Conference on Machine Learning and Applications (ICMLA). IEEE, 2024. https://doi.org/10.1109/icmla61862.2024.00137.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Pan, Haiyu, Min Zhang, Yixiang Chen, and Hengyang Wu. "Approximate Bisimulation for Metric Doubly Labeled Transition System." In 2011 IEEE 5th International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE, 2011. http://dx.doi.org/10.1109/tase.2011.22.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Julius, A. A., A. Girard, and G. J. Pappas. "Approximate bisimulation for a class of stochastic hybrid systems." In 2006 American Control Conference. IEEE, 2006. http://dx.doi.org/10.1109/acc.2006.1657467.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Pola, Giordano, Antoine Girard, and Paulo Tabuada. "Symbolic models for nonlinear control systems using approximate bisimulation." In 2007 46th IEEE Conference on Decision and Control. IEEE, 2007. http://dx.doi.org/10.1109/cdc.2007.4434911.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Xu, Xiangru, Necmiye Ozay, and Vijay Gupta. "Passivity degradation in discrete control implementations: An approximate bisimulation approach." In 2015 54th IEEE Conference on Decision and Control (CDC). IEEE, 2015. http://dx.doi.org/10.1109/cdc.2015.7403293.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Xiang, Weiming, and Zhongzhu Shao. "Approximate Bisimulation Relations for Neural Networks and Application to Assured Neural Network Compression." In 2022 American Control Conference (ACC). IEEE, 2022. http://dx.doi.org/10.23919/acc53348.2022.9867845.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Dukic, Savo D., Andrija T. Saric, and Aleksandar M. Stankovic. "Approximate bisimulation-based reduction of power system dynamic model with application to transient stability analysis." In 2013 North American Power Symposium (NAPS). IEEE, 2013. http://dx.doi.org/10.1109/naps.2013.6666882.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Ma, Guoqi, Linlin Qin, Xinghua Liu, Chun Shi, and Gang Wu. "Approximate bisimulations for constrained discrete-time linear systems (ICCAS 2015)." In 2015 15th International Conference on Control, Automation and Systems (ICCAS). IEEE, 2015. http://dx.doi.org/10.1109/iccas.2015.7364774.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Ma, Guoqi, and Xinghua Liu. "Analysis for a class of discrete-time switched systems via approximate bisimulations." In 2016 12th World Congress on Intelligent Control and Automation (WCICA). IEEE, 2016. http://dx.doi.org/10.1109/wcica.2016.7578722.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Wild, Paul, Lutz Schröder, Dirk Pattinson, and Barbara König. "A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/263.

Texto completo
Resumen
The fuzzy modality probably is interpreted over probabilistic type spaces by taking expected truth values. The arising probabilistic fuzzy description logic is invariant under probabilistic bisimilarity; more informatively, it is non-expansive wrt. a suitable notion of behavioural distance. In the present paper, we provide a characterization of the expressive power of this logic based on this observation: We prove a probabilistic analogue of the classical van Benthem theorem, which states that modal logic is precisely the bisimulation-invariant fragment of first-order logic. Specifically, we s
Los estilos APA, Harvard, Vancouver, ISO, etc.
También puede estar interesado en las bibliografías ampliadas sobre el tema "Approximate bisimulation" para tipos de fuentes particulares:
Artículos de revistas
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía