On the Relationship Between Bisimulation and Combinatorial Filter Reduction

Rahmani, Hazhar; O’Kane, Jason M.

doi:10.1109/icra.2018.8460507

Cited by 11 publications

(7 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By → sn = {(s 1 sn t 1 sn s 2 sn ), (s 2 sn t 2 sn s 3 sn ), (s 3 sn t 3 sn s 3 sn ), (s 3 sn t 4 sn s 4 sn ), (s 4 sn t 5 sn s 1 sn )}, s 0 sn = Disconnected. The mathematical formalism of bi-simulation is used to prove that the FSMs are harmonized, i.e., their behaviour on stimulus from the network and MEC application is equivalent [26], [27].…”

Section: Mathematical Models Of Behavioural Settingsmentioning

confidence: 99%

Programmability of Connectivity Control

Atanasov¹,

Pencheva²

2021

ELEKTRON ELEKTROTECH

View full text Add to dashboard Cite

Network programmability and edge computing as key features of next generation communications enable innovative services. While the programmability is focused on the core network of the fifth-generation system, the edge computing moves the network intelligence to the radio access network. This paper presents a study on the programmability of connectivity control as a function of radio access network using Multi-access Edge Computing. The capability of using more than one radio access technology simultaneously enhances reliability and increases the throughput, especially in dense networks. Opening the radio access network interfaces for programmability of multi-connectivity enables analytics applications to control the device connections to multiple radio links simultaneously based on information of radio conditions, user location or specific policies. The research novelty is in opening the radio access network interfaces for edge applications to access connectivity control.

show abstract

Section: Mathematical Models Of Behavioural Settingsmentioning

confidence: 99%

Programmability of Connectivity Control

Atanasov¹,

Pencheva²

2021

ELEKTRON ELEKTROTECH

View full text Add to dashboard Cite

show abstract

“…The definition of the reduction problems within [5,8,9] are specified so as to require that the output obtained be deterministic. But this postcondition is never shown formally established.…”

Section: Via This Compatibility Relation We Get a Undirected Compatib...mentioning

confidence: 99%

“…We denote the set of all auxiliary constraints on the compatibility G = K(F ) with the symbol A(F ). A third idea is used by O'Kane and Shell's heuristic algorithm and is also stated, rather more explicitly, by Saberifar et al (see Lemma 5 in [8] and Lemma 5 in [9]). It indicates that we can obtain a minimal filter via merging operations on the compatible states.…”

Section: Via This Compatibility Relation We Get a Undirected Compatib...mentioning

confidence: 99%

Cover Combinatorial Filters and their Minimization Problem (Extended Version)

Zhang

Shell

2020

Preprint

View full text Add to dashboard Cite

A recent research theme has been the development of automatic methods to minimize robots' resource footprints. In particular, the class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods developed for automatically reducing their space requirements. This paper extends existing combinatorial filters by introducing a natural generalization that we dub cover combinatorial filters. In addressing the new -but still NPcomplete-problem of minimization of cover filters, this paper shows that three of the concepts previously believed to be true about combinatorial filters (and actually conjectured, claimed, or assumed to be) are in fact false. For instance, minimization does not induce an equivalence relation. We give an exact algorithm for the cover filter minimization problem. Unlike prior work (based on graph coloring) we consider a type of clique-cover problem, involving a new conditional constraint, from which we can find more general relations. In addition to solving the more general problem, the algorithm we present also corrects flaws present in all prior filter reduction methods. The algorithm also forms a promising basis for practical future development as it involves a reduction to SAT.

show abstract

“…At least for the question of bisimulation, a notion of equivalence employed in process algebras (and, importantly with respect to the present study, along with some generalizations to systems with continuous dynamics, see Haghverdi et al (2005)), one of the authors has recently obtained a clear result on the relationship between the bisimulation relation and filter reduction. Rahmani and O’Kane (2018) showed that filter reduction (see Section 5.2) can be achieved by quotienting an input filter by some relation and that bisimilarity is not the correct notion of equivalence for some types of filters.…”

Section: Related Workmentioning

confidence: 99%

Toward a language-theoretic foundation for planning and filtering

Saberifar

Ghasemlou

Shell

et al. 2018

The International Journal of Robotics Research

View full text Add to dashboard Cite

We address problems underlying the algorithmic question of automating the co-design of robot hardware in tandem with its apposite software. Specifically, we consider the impact that degradations of a robot's sensor and actuation suites may have on the ability of that robot to complete its tasks. We introduce a new formal structure that generalizes and consolidates a variety of well-known structures including many forms of plans, planning problems, and filters, into a single data structure called a procrustean graph, and give these graph structures semantics in terms of ideas based in formal language theory. We describe a collection of operations on procrustean graphs (both semantics-preserving and semantics-mutating), and show how a family of questions about the destructiveness of a change to the robot hardware can be answered by applying these operations. We also highlight the connections between this new approach and existing threads of research, including combinatorial filtering, Erdmann's strategy complexes, and hybrid automata.

show abstract

On the Relationship Between Bisimulation and Combinatorial Filter Reduction

Cited by 11 publications

References 23 publications

Programmability of Connectivity Control

Programmability of Connectivity Control

Cover Combinatorial Filters and their Minimization Problem (Extended Version)

Toward a language-theoretic foundation for planning and filtering

Contact Info

Product

Resources

About