Results 61 to 70 of about 13,172 (205)

Approximate reasoning for real-time probabilistic processes [PDF]

Logical Methods in Computer Science, 2006
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisimulation for continuous-time probabilistic processes to a much broader ...
Vineet Gupta, Radha Jagadeesan, Prakash Panangaden   +2 more
doaj   +1 more source

Distribution-based bisimulation for labelled Markov processes

, 2017
In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both only compare states.
A Abate, A Abate, D Gebler, EP Vink, F Breugel van, G Bacci, H Hermanns, J Desharnais, J Desharnais, J Desharnais, JG Kemeny, KG Larsen, L Doyen, M Hennessy, N Ferns, N Urabe, P Chaput, P Panangaden, PR D’Argenio, R Durrett, R Segala, V Danos, V Danos, V Danos, Y Deng, Y Feng   +25 more
core   +1 more source

Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes [PDF]

, 2013
We consider PML, the probabilistic version of Hennessy-Milner logic introduced by Larsen and Skou to characterize bisimilarity over probabilistic processes without internal nondeterminism.We provide two different interpretations for PML by considering ...
Bernardo, Marco, De Nicola, Rocco, Loreti, Michele   +2 more
core   +2 more sources

Improving Probabilistic Bisimulation for MDPs Using Machine Learning [PDF]

Mathematics Interdisciplinary Research
‎The utilization of model checking has been suggested as a formal verification technique for analyzing critical systems‎. ‎However‎, ‎the primary challenge in applying to complex systems is the state space explosion problem‎.
Mohammadsadegh Mohagheghi, Khayyam Salehi   +1 more
doaj   +1 more source

Sound Bisimulations for Higher-Order Distributed Process Calculus [PDF]

, 2011
While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such systems modelled in ...
Piérard, Adrien, Sumii, Eijiro
core   +3 more sources

Computation Tree Logic with Deadlock Detection [PDF]

Logical Methods in Computer Science, 2009
We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL-X).
Rob van Glabbeek, Bas Luttik, Nikola Trcka   +2 more
doaj   +1 more source

Temporal Dependency‐Aware Trajectory‐Level Behavioural Metric for Exploration in Reinforcement Learning

CAAI Transactions on Intelligence Technology, Volume 11, Issue 2, Page 332-348, April 2026.
ABSTRACT Intrinsic motivation serves as the predominant paradigm of exploration in reinforcement learning. In pursuit of an informative and robust state representation, the behavioural metric groups behaviourally equivalent states together, which share the same single‐step reward and transition distribution.
Anjie Zhu, Yongjun Yang, Guangyi Zhao, Jie Shao   +3 more
wiley   +1 more source

Verification of parallelising transformations of KPN models

IET Cyber-Physical Systems: Theory &Applications, Volume 4, Issue 3, Page 276-289, September 2019., 2019
Parallelising transformations of Kahn process networks (KPNs) are important mechanisms for achieving speedup for deployment on heterogeneous multiprocessor systems particularly in the domain of signal processing applications. Correctness of such parallelising transformations is crucial for their reliable applications.
Chandan Karfa, Dipankar Sarkar, Chittaranjan Mandal   +2 more
wiley   +1 more source

Bisimulation of automata

Information and Computation, 1988
The authors give an algebraic characterization of automata and discuss various types of simulation between them. Their environment is the category PureAut whose objects are so-called incompletely-specified nondeterministic input-only automata with a set of pure states, and whose morphisms are given by certain maps between the sets of pure states.
David B. Benson, Ofer Ben-Shachar
openaire   +2 more sources

Rooted branching bisimulation as a congruence for probabilistic transition systems [PDF]

Electronic Proceedings in Theoretical Computer Science, 2015
We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence theorem is based on the approach of Fokkink for the qualitative case.
Matias D. Lee, Erik P. de Vink
doaj   +1 more source