English
Related papers

Related papers: Determination of action model equivalence and simp…

200 papers

State explosion problem is the main obstacle of model checking. In this paper, we try to solve this problem from a coalgebraic approach. We establish an effective method to prove uniformly the existence of the smallest Kripke structure with…

Logic in Computer Science · Computer Science 2016-06-06 Jianhua Gao , Ying Jiang

Bisimulations are standard in modal logic and, more generally, in the theory of state-transition systems. The quotient structure of a Kripke model with respect to the bisimulation relation is called a bisimulation contraction. The…

Logic in Computer Science · Computer Science 2024-05-02 Thomas Bolander , Alessandro Burigana

This paper presents a novel theoretical framework for the state space reduction of Kripke structures. We define two equivalence relations, Kripke minimization equivalence (KME) and weak Kripke minimization equivalence (WKME). We define the…

Formal Languages and Automata Theory · Computer Science 2012-10-02 Arpit Sharma

Event structures represent concurrent processes in terms of events and dependencies between events modelling behavioural relations like causality and conflict. Since the introduction of prime event structures, many variants of event…

Logic in Computer Science · Computer Science 2014-07-01 Abel Armas-Cervantes , Paolo Baldan , Luciano Garcia-Bañuelos

It is shown that in the planar equal-mass four-body problem, there exist two sets of new action minimizers connecting two planar boundary configurations with fixed symmetry axes and specific order constraints on the four bodies: a double…

Dynamical Systems · Mathematics 2017-10-30 Duokui Yan

We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…

Logic in Computer Science · Computer Science 2026-04-14 Alfredo Burrieza , Fernando Soler-Toscano , Antonio Yuste-Ginel

In many applications involving spatial point patterns, we find evidence of inhibition or repulsion. The most commonly used class of models for such settings are the Gibbs point processes. A recent alternative, at least to the statistical…

Computation · Statistics 2016-08-29 Shinichiro Shirota , Alan. E. Gelfand

Event structures are fundamental models in concurrency theory, providing a representation of events in computation and of their relations, notably concurrency, conflict and causality. In this paper we present a theory of minimisation for…

Logic in Computer Science · Computer Science 2019-07-17 Paolo Baldan , Alessandra Raffaetà

Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The…

Artificial Intelligence · Computer Science 2018-02-06 Mikkel Birkegaard Andersen , Thomas Bolander , Hans van Ditmarsch , Martin Holm Jensen

Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic systems to display the same behaviour there are a multitude…

Logic in Computer Science · Computer Science 2012-10-10 Martin Lange , Etienne Lozes , Manuel Vargas Guzmán

We study a system of diffusing point particles in which any triplet of particles reacts and is removed from the system when the relative proximity of the constituent particles satisfies a predefined condition. Proximity-based reaction…

Numerical Analysis · Mathematics 2025-04-07 Taylor Kearney , Ricardo Ruiz-Baier , Mark B. Flegg

Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e.,…

Logic in Computer Science · Computer Science 2023-06-22 David Baelde , Stéphanie Delaune , Lucca Hirschi

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…

Logic in Computer Science · Computer Science 2012-07-12 J. Markovski

This paper introduces a probabilistic graphical model for continuous action recognition with two novel components: substructure transition model and discriminative boundary model. The first component encodes the sparse and global temporal…

Computer Vision and Pattern Recognition · Computer Science 2012-03-12 Zhaowen Wang , Jinjun Wang , Jing Xiao , Kai-Hsiang Lin , Thomas Huang

Understanding which features humans rely on -- in visually recognizing action similarity is a crucial step towards a clearer picture of human action perception from a learning and developmental perspective. In the present work, we…

We study the problem of causal structure learning from a combination of observational and interventional data generated by a linear non-Gaussian structural equation model that might contain cycles. Recent results show that using mere…

Machine Learning · Statistics 2025-12-05 Ehsan Sharifian , Saber Salehkaleybar , Negar Kiyavash

Linearizability and progress properties are key correctness notions for concurrent objects. However, model checking linearizability has suffered from the PSPACE-hardness of the trace inclusion problem. This paper proposes to exploit…

Programming Languages · Computer Science 2016-10-03 Xiaoxiao Yang , Joost-Pieter Katoen , Huimin Lin , Hao Wu

The paper proposes a novel model assessment paradigm aiming to address shortcoming of posterior predictive $p-$values, which provide the default metric of fit for Bayesian structural equation modelling (BSEM). The model framework of the…

Methodology · Statistics 2022-06-30 Konstantinos Vamvourellis , Konstantinos Kalogeropoulos , Irini Moustaki

Optimizing robotic action parameters is a significant challenge for manipulation tasks that demand high levels of precision and generalization. Using a model-based approach, the robot must quickly reason about the outcomes of different…

Robotics · Computer Science 2024-03-19 M. Yunus Seker , Oliver Kroemer

This paper presents an efficient parallel approximation scheme for a new class of min-max problems. The algorithm is derived from the matrix multiplicative weights update method and can be used to find near-optimal strategies for…

Quantum Physics · Physics 2015-03-17 Gus Gutoski , Xiaodi Wu
‹ Prev 1 2 3 10 Next ›