نتایج جستجو برای: partial ordering

تعداد نتایج: 263230  

Journal: :International Journal of Computer Applications 2012

2006
Robert Lorenz Gabriel Juhás

Given a set of scenarios, we answer the question whether this set equals the set of all executions of a Petri net. Formally, scenarios are expressed by (isomorphism classes of) labelled partial orders (LPOs), also known as pomsets or partial words. An LPO is an execution of a Petri net if it is a sequentialization of an LPO generated by a process of the net. We propose a definition of regions f...

2016
R. Meenakshi

In this paper we introduce the notion of fuzzy  semigroup via fuzzy partial ordering and investigate some properties connected with fuzzy  semigroup. Keyword: Fuzzy  semigroup

2008
Susanta K. Khan Anita Pal

In this paper, we introduce the concept of generalised inverse (ginverse) for intuitionistic fuzzy matrices (IFMs). We define minus partial ordering and studied several properties of it. Here we have shown that the minus partial ordering is a partial ordering for IFMs.

2016
Helene Haagh Yue Ji Chenxing Li Claudio Orlandi Yifan Song

We generalize the cryptographic notion of Order Revealing Encryption (ORE) to arbitrary functions and we present a construction that allows to determine the (partial) ordering of two vectors i.e., given E(x) and E(y) it is possible to learn whether x ≥ y, y ≥ x or whether x and y are incomparable. This is the first non-trivial example of a Revealing Encryption (RE) scheme with output larger tha...

Journal: :Multiple-Valued Logic and Soft Computing 2016
Stefan Haar

The orientation problem for ternary cyclic order relations has been attacked in the literature from combinatorial perspectives, through rotations, and by connection with Petri nets. We propose here a two-fold characterization of orientable cyclic orders in terms of symmetries of partial orders as well as in terms of separating sets (cuts). The results are inspired by properties of non-sequentia...

2007
Corrado Priami

This paper present a partial ordering semantics for process calculi. The semantics is deened in SOS style and it is based on transition systems. We adopt proved transition system, whose transitions are labelled with encodings of their proofs and whose nodes are the same of the classical interleaving semantics. Relabelling functions are deened to retrive causal models that can take generation or...

Journal: :Journal of Physics A: Mathematical and Theoretical 2014

Journal: :Proceedings of the National Academy of Sciences 1950

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید