نتایج جستجو برای: congruence relation

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

2012

The aim of this study is to test the “work values” inventory developed by Tevruz and Turgut and to utilize the concept in a model, which aims to create a greater understanding of the work experience. In the study multiple effects of work values, work-value congruence and work centrality on organizational citizenship behavior are examined. In this respect, it is hypothesized that work values and...

Journal: :J. Log. Algebr. Meth. Program. 2018
Mario Bravetti

Stochastic (Markovian) process algebra extend classical process algebra with probabilistic exponentially distributed time durations denoted by rates (the parameter of the exponential distribution). Defining a semantics for such an algebra, so to derive Continuous Time Markov Chains from system specifications, requires dealing with transitions labeled by rates. With respect to standard process a...

1995
Ralph Freese

such that f(g(a)) = a for all a ∈ L. Projective lattices are characterized in [3] by four conditions. This talk will discuss two of them that are of current interest. If g in (2) is only required to be order-preserving, it is called an isotone section of the epimorphism (1). We will characterize which lattices L have an isotope section for every epimorphism (1). We will use this to characterize...

2005
P. AGLIANO K. A. KEARNES

The lattice of closed subsets of a set under such a closure operator is semimodular. Perhaps the best known example of a closure operator satisfying the exchange principle is the closure operator on a vector space W where for X ___ W we let C(X) equal the span of X. The lattice of C-closed subsets of W is isomorphic to Con(W) in a natural way; indeed, if Y _~ W x W and Cg(Y) denotes the congrue...

2007
Bert van Geemen

A description and an example are given of numerical experiments which look for a relation between modular forms for certain congruence subgroups of SL(3; Z Z) and Galois representations.

Journal: :Electronic proceedings in theoretical computer science 2023

Enabling preserving bisimilarity is a refinement of strong that preserves safety as well liveness properties. To define it properly, labelled transition systems needed to be upgraded with successor relation, capturing concurrency between transitions enabled in the same state. We enrich well-known De Simone format handle inductive definitions this relation. then establish ep-bisimilarity congrue...

Journal: :Logical Methods in Computer Science 2007
Rob J. van Glabbeek Bas Luttik Nikola Trcka

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). This relation is obtained by De Nicola & Vaandrager by translating labelled transition systems to Kripke structures, while lifting the totality restriction on the latter. They characterised it as divergence sensitive branch...

2010
FRANCIS PASTIJN MARIO PETRICH

Let S be a regular semigroup and let p be a congruence relation on S. The kernel of p, in notation kerp, is the union of the idempotent p-classes. The trace of p, in notation trp, is the restriction of p to the set of idempotents of S. The pair (kerp,trp) is said to be the congruence pair associated with p. Congruence pairs can be characterized abstractly, and it turns out that a congruence is ...

1995
Yoshinao Isobe Yutaka Sato Kazuhito Ohmaki

In this paper we propose a process algebra named CCB (a Calculus of Countable Broadcasting Systems). We define an observational congruence relation in CCB after basic definitions of CCB, and give a sound and complete axiom system for the congruence relation of finite agents. CCB is developed for analyzing a multi-agent model with broadcast communication. The most important property of CCB is th...

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

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