Filters








2,073 Hits in 7.4 sec

Ready to preorder: an algebraic and general proof

de David Frutos Escrig, Carlos Gregorio Rodríguez, Miguel Palomino
2009 The Journal of Logic and Algebraic Programming  
Following the algebraic approach suggested above, in this paper we present a much simpler proof of that result which, in addition, is more general and totally uniform, so that it does not need to consider  ...  Recently Aceto et al. have presented a very interesting result: for any process preorder coarser than the ready simulation in the linear time-branching time spectrum they show how to get an axiomatization  ...  Acknowledgments We would like to thank Aceto, Fokkink, and Ingólfsdóttir for very interesting discussions, both through email and during a brief meeting in Paris.  ... 
doi:10.1016/j.jlap.2008.09.001 fatcat:pnfegvypsbd2tosqqixl5nbgw4

Ready To Preorder: Get Your BCCSP Axiomatization for Free!

Luca Aceto, Willem Jan Fokkink, Anna Ingólfsdóttir
2007 BRICS Report Series  
It offers an algorithm for producing a complete (respectively, ground-complete) equational axiomatization of a behavioral congruence lying between ready simulation equivalence and partial traces equivalence  ...  This paper contributes to the study of the equational theory of the semantics in van Glabbeek's linear time - branching time spectrum over the language BCCSP, a basic process algebra for the description  ...  ready simulation preorder.  ... 
doi:10.7146/brics.v14i3.21926 fatcat:cizmw6e2yvh7tajiott5dayksq

Ready to preorder: The case of weak process semantics

Taolue Chen, Wan Fokkink, Rob van Glabbeek
2008 Information Processing Letters  
Recently, Aceto, Fokkink and Ingólfsdóttir proposed an algorithm to turn any sound and ground-complete axiomatisation of any preorder listed in the linear time-branching time spectrum at least as coarse  ...  Subsequently, de Frutos Escrig, Gregorio Rodríguez and Palomino generalised this result, so that the algorithm is applicable to any preorder at least as coarse as the ready simulation preorder, provided  ...  the ready simulation preorder, and generates as output an equational axiomatisation A(E) which is sound and ground-complete for BCCS modulo the corresponding congruence.  ... 
doi:10.1016/j.ipl.2008.09.003 fatcat:hcacdposinap3cmgufyz3hthdm

On Efficiency Preorders [chapter]

Manish Gaur, S. Arun-Kumar
2013 Lecture Notes in Computer Science  
Theories of efficiency preorders and precongruences for concurrent systems have been described in various papers. We describe a procedure to implement two of these precongruences.  ...  Considering the extra information that is needed to be maintained while computing efficiency preorders, our procedure with a complexity O(n 3 m), compares favourably with that for deciding observational  ...  In general, algorithms for computing semantic equivalences and preorders usually consist of two steps.  ... 
doi:10.1007/978-3-642-40213-5_6 fatcat:cwsz7tsvnvfrbgnqehhpaw6xqq

Syntax for Split Preorders [article]

K. Dosen, Z. Petric
2012 arXiv   pre-print
The paper presents by generators and equations the category SplPre, whose arrows are the split preorders on the disjoint union of two finite ordinals.  ...  A split preorder is a preordering relation on the disjoint union of two sets, which function as source and target when one composes split preorders.  ...  In general we favour this style, but our subject matter is not only logical-it belongs more to the categorial foundations of algebra-and we do not want to discomfort by our style readers of an already  ... 
arXiv:0902.0742v7 fatcat:nt42wt2wdzag5aykwdddegibma

Toward a Theory of Monomial Preorders [article]

Gregor Kemper, Ngo Viet Trung, Nguyen Thi Van Anh
2017 arXiv   pre-print
Since for monomial preorders, the leading ideal is less degenerate than for monomial orders, our results can be used to study problems where monomial orders fail to give a solution.  ...  Some of our results are new even in the classical case of monomial orders and in the special case in which the leading ideal defines the tangent cone.  ...  We can use the leading ideal of monomial preorders to study different subjects in algebra and geometry.  ... 
arXiv:1608.03725v3 fatcat:ni3puv4ge5ajjciin65j2tzxmy

Simulations Up-to and Canonical Preorders

David de Frutos Escrig, Carlos Gregorio Rodríguez
2007 Electronical Notes in Theoretical Computer Science  
The result applies to a wide class of preorders, in particular to all semantic preorders coarser than the ready simulation preorder in the linear time-branching time spectrum.  ...  Process algebras have been largely used to specify and study the behaviour of reactive systems and have given rise to well known languages such as CSP, CCS or ACP.  ...  Acknowledgements We would like to express our gratitude to Miguel Palomino for all his comments on a previous version of this paper.  ... 
doi:10.1016/j.entcs.2007.08.014 fatcat:gncifvcymvadndypvuwungymwe

A classification of algebras stratified for all preorders by Koszul theory [article]

Liping Li
2012 arXiv   pre-print
In this paper we develop a generalized Koszul theory generalizing many classical results, and use it to classify algebras stratified for all preorders.  ...  Let A = ⊕_i ≥ 0 A_i be a graded locally finite k-algebra such that A_0 is an arbitrary finite-dimensional algebra satisfying some splitting condition.  ...  For an example, please refer to Example 4.3.  ... 
arXiv:1202.2479v2 fatcat:kqezpcmikvbz3ni2lonwgqtyue

Language preorder as a precongruence

Wan Fokkink
2000 Theoretical Computer Science  
This article proposes additional syntactic requirements on the tyft format, extended with predicates, to obtain a precongruence format for language preorder.  ...  Groote and Vaandrager introduced the tyft format, which is a congruence format for strong bisimulation equivalence.  ...  We focus on language preorder (instead of equivalence), because this yields a more general precongruence result, and simpliÿes proofs.  ... 
doi:10.1016/s0304-3975(98)00267-9 fatcat:mpqnucatsjdazjug46o3vxqlsa

Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences

David de Frutos Escrig, Carlos Gregorio Rodríguez, Miguel Palomino
2008 Electronical Notes in Theoretical Computer Science  
Following a different path we were able to get a correct proof and an enhanced algorithm.  ...  By means of these new proofs and results we hope to contribute to a better knowledge of the semantics of processes and to better understand the tight relations between preorders and equivalences that define  ...  We also use algebraic arguments to prove the following theorem Next we will present an alternative proof of Theorem 4.3.  ... 
doi:10.1016/j.entcs.2008.04.059 fatcat:jqksu7iv45boxcdlaq54i2qthy

Ordinal decompositions for preordered root systems

James B. Hart, Constantine Tsinakis
2009 Annals of Pure and Applied Logic  
We conclude the paper with an application to information systems.  ...  means of alternating applications of disjoint union and ordinal sums with chains.  ...  The variety of representable residuated lattices is generated by its totally ordered members and includes the varieties of MV-algebras, BL-algebras and Gödel algebras.  ... 
doi:10.1016/j.apal.2009.05.004 fatcat:yady4qynbbdtvlizke4xhphylm

Compliance and Testing Preorders Differ [chapter]

Giovanni Bernardi, Matthew Hennessy
2014 Lecture Notes in Computer Science  
Contracts play an essential role in the Service Oriented Computing, for which they need to be equiped with a sub-contract relation.  ...  We compare two possible formulations, one based on compliance and the other on the testing theory of De Nicola and Hennessy.  ...  the sub-contract relation use ready sets, which were already in the behavioural characterisation of the must-testing preorder [DH84] .  ... 
doi:10.1007/978-3-319-05032-4_6 fatcat:nn53fwoww5f6lj627kit4fuf74

Interference-Sensitive Preorders for MANETs

Michele Bugliesi, Lucia Gallina, Andrea Marin, Sabina Rossi, Sardaouna Hamadou
2012 2012 Ninth International Conference on Quantitative Evaluation of Systems  
The framework includes a probabilistic process calculus and a suite of analytical techniques based on a probabilistic observational congruence and an interference-sensitive preorder.  ...  The preorder makes it possible to evaluate the interference level of different, behaviourally equivalent, networks.  ...  Processes are sequential and live within the nodes: 0 is the inactive process; in(c,x).P is ready to listen to a transmission, while out c L,r ,w .P is ready to transmit.  ... 
doi:10.1109/qest.2012.15 dblp:conf/qest/BugliesiGMRH12 fatcat:tptgl4cwh5e3nntornzge7ow7e

Torsion theories and coverings of preordered groups [article]

Marino Gran, Aline Michel
2020 arXiv   pre-print
The reflector from the category of preordered groups to this torsion-free subcategory has stable units, and we prove that it induces a monotone-light factorization system.  ...  We describe the coverings relative to the Galois structure naturally associated with this reflector, and explain how these coverings can be classified as internal actions of a Galois groupoid.  ...  We are now ready to state the final result of this section. Theorem 3.12.  ... 
arXiv:2005.07937v2 fatcat:zivp6r7k45fdjpna7ofj4yksni

A new Galois structure in the category of internal preorders [article]

Alberto Facchini, Carmelo Finocchiaro, Marino Gran
2020 arXiv   pre-print
Let PreOrd(C) be the category of internal preorders in an exact category C.  ...  The reflector F:PreOrd(C)→ParOrd(C) turns out to have stable units in the sense of Cassidy, Hébert and Kelly, thus inducing an admissible categorical Galois structure.  ...  The authors would like to thank to the anonymous referee for several useful suggestions on the first version of the paper.  ... 
arXiv:1909.08826v2 fatcat:42nxctycwvfwvpizt4csyk6px4
« Previous Showing results 1 — 15 out of 2,073 results