Filters








19,948 Hits in 7.1 sec

Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events [chapter]

Massimo Franceschet, Angelo Montanari
2000 Lecture Notes in Computer Science  
In this paper, we show how well-known graph-theoretic techniques can be successfully exploited to efficiently reason about partially ordered events in Kowalski and Sergot's Event Calculus and in its skeptical  ...  We replace the traditional generate-and-test strategy of basic Event Calculus by a generate-only strategy that operates on the transitive closure and reduction of the underlying directed acyclic graph  ...  Conclusions In this paper, we have shown how the graph-theoretic notions of transitive closure and reduction of a directed acyclic graph can be successfully exploited to efficiently reason about partially  ... 
doi:10.1007/3-540-46238-4_12 fatcat:2l5dyfvmbnaxfcogltnqljhvjm

The Minimal Dependency Relation for Causal Event Ordering in Distributed Computing

S. E. Pomares Hernandez
2015 Applied Mathematics & Information Sciences  
In this pursuit, some previous works talk about the use of a transitive reduction of the causality.  ...  One common aspect among them is that they intend to be efficient in their implementation by identifying and ensuring the necessary and sufficient dependency constraints.  ...  According to Property 3, if a partially ordered set is finite, its covering relation is the transitive reduction of the partial order relation.  ... 
doi:10.12785/amis/090108 fatcat:w6yl57j4kja2hhvtrar5ipdlti

The Minimal Dependency Relation for Causal Event Ordering in Distributed Computing

S. E. Pomares Hernandez
2015 Applied Mathematics & Information Sciences  
In this pursuit, some previous works talk about the use of a transitive reduction of the causality.  ...  One common aspect among them is that they intend to be efficient in their implementation by identifying and ensuring the necessary and sufficient dependency constraints.  ...  According to Property 3, if a partially ordered set is finite, its covering relation is the transitive reduction of the partial order relation.  ... 
doi:10.12785/amis/010108 fatcat:h7ebst3k65aevlwun7rswglx2a

Reduction of Order Structures

Lukasz Mikulski, Andrey Mokhov, Marcin Piatkowski
2017 2017 17th International Conference on Application of Concurrency to System Design (ACSD)  
We provide a new and more concise axiomatic definition of these structures, investigate their important properties, and present efficient algorithms for computing their reduction and closure.  ...  To reduce the complexity of order structures, one typically considers only their essential components, which, in the case of partial orders, leads to the notion of Hasse diagrams.  ...  Since generalised mutex-order structures are in this case counterparts of partially ordered sets, it is natural to ask the question about their closure and reduction operations.  ... 
doi:10.1109/acsd.2017.17 dblp:conf/acsd/MikulskiMP17 fatcat:kpqaqhxerjc4fl4y2csqjqxwbq

Discovering Frequent Closed Partial Orders from Strings

Jian Pei, Haixun Wang, Jian Liu, Ke Wang, Jianyong Wang, P.S. Yu
2006 IEEE Transactions on Knowledge and Data Engineering  
We report an extensive performance study on both real data sets and synthetic data sets to illustrate the effectiveness and the efficiency of our approach.  ...  To tackle the problem, we develop Frecpo (for Frequent closed partial order), a practically efficient algorithm for mining the complete set of frequent closed partial orders from large string databases  ...  Bongki Moon, the associate editor, and the anonymous reviewers for their insightful and constructive comments, especially their suggestions on the complexity analysis and the pointers to related work on  ... 
doi:10.1109/tkde.2006.172 fatcat:mt47gh36nfhyxc7hqfslhepqvy

Page 2103 of Mathematical Reviews Vol. , Issue 2002C [page]

2002 Mathematical Reviews  
|Montanari, Angelo] (I-UDIN-MI; Udine) A graph-theoretic approach to efficiently reason about partially ordered events in (modal) event calculus.  ...  Summary: “In this paper, we show how well-known graph- theoretic techniques can be successfully exploited to efficiently reason about partially ordered events in Kowalski and Sergot’s event calculus and  ... 

Value-centric Dynamic Partial Order Reduction [article]

Krishnendu Chatterjee and Andreas Pavlogiannis and Viktor Toman
2019 arXiv   pre-print
As there are exponentially many traces, dynamic partial-order reduction (DPOR) techniques are used to partition the trace space into equivalence classes, and explore a few representatives from each class  ...  Our results show that value-happens-before typically induces a significant reduction in the size of the underlying partitioning, which leads to a considerable reduction in the running time for exploring  ...  Acknowledgments The authors would also like to thank anonymous referees for their valuable comments and helpful suggestions.  ... 
arXiv:1909.00989v1 fatcat:zvc24yzt45bahkvsnizfti3ofm

Evaluating Temporal Graphs Built from Texts via Transitive Reduction

X. Tannier, P. Muller
2011 The Journal of Artificial Intelligence Research  
graph, or more formally the transitive reduction of the graph of relations between event boundaries.  ...  Finding a common comparison referent at the text level is not obvious, and we argue here in favor of a shift from event-based measures to measures on a unique textual object, a minimal underlying temporal  ...  The measure is defined on the transitive reductions of the graph of (partially) ordered interval endpoints.  ... 
doi:10.1613/jair.3118 fatcat:gazlcmanmzgdxce5lulpnvyjau

Partial Orders for Efficient Bounded Model Checking of Concurrent Software [chapter]

Jade Alglave, Daniel Kroening, Michael Tautschnig
2013 Lecture Notes in Computer Science  
Modelling program executions with partial orders rather than interleavings addresses both issues: we obtain an efficient encoding into integer difference logic for bounded model checking that enables first-time  ...  We implemented the encoding in the CBMC tool and present experiments over a wide range of memory models, including SC, Intel x86 and IBM Power.  ...  Acknowledgements We thank Matthew Hague, Alex Horn, Lihao Liang, Vincent Nimal, Peter O'Hearn and Georg Weissenbacher for invaluable discussions and comments.  ... 
doi:10.1007/978-3-642-39799-8_9 fatcat:loacw7ab3bfxvpn6eh2rvqcoma

Summarizing Sequential Data with Closed Partial Orders [chapter]

Gemma Casas-Garriga
2005 Proceedings of the 2005 SIAM International Conference on Data Mining  
Our goal is not mining these structures directly from the data, but going beyond the idea of closed sequential patterns and generalize it into a novel notion of closed partial order.  ...  We will show that just a simple (but not trivial) post-processing of the closed sequences found in the data leads to a compact set of informative closed partial orders.  ...  Balcázar for his useful discussions and comments, and also Pablo Díaz-López for helping with the implementations and experiments.  ... 
doi:10.1137/1.9781611972757.34 dblp:conf/sdm/Casas-Garriga05 fatcat:znee2xej3vbo7lncdlr7cjalmq

Modeling concurrency with partial orders

Vaughan Pratt
1986 International journal of parallel programming  
Concurrency has been expressed variously in terms of formal languages (typically via the shuffle operator), partial orders, and temporal logic, inter alia.  ...  The heart of the approach is a notion of partial string derived from the view of a string as a linearly ordered multiset by relaxing the linearity constraint, thereby permitting partially ordered multisets  ...  The local concatenation p;p of p and p is that augment of p p obtained by adding to the order all colocated pairs (u, u ) ∈ V × V and then taking the transitive closure of the result.  ... 
doi:10.1007/bf01379149 fatcat:iqmhi2qgffbbzcfxnucdejuvce

AN EFFICIENT FULLY SYMBOLIC BISIMULATION ALGORITHM FOR NON-DETERMINISTIC SYSTEMS

MALCOLM MUMME, GIANFRANCO CIARDO
2013 International Journal of Foundations of Computer Science  
We compare our fully symbolic saturation-based implementation with the fastest extant bisimulation algorithms over a set of benchmarks, and conclude that it appears to be the fastest algorithm capable  ...  The definition of bisimulation suggests a partition-refinement step, which we show to be suitable for a saturation-based implementation.  ...  Acknowledgments This work was partially supported by the National Science Foundation under grant CCF-1018057.  ... 
doi:10.1142/s012905411340011x fatcat:kiijmvxhhfh7zirynu3v44jjl4

k-Dependency Vectors: a scalable causality-tracking protocol

R. Baldoni, G. Melideo
2003 Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings.  
In the paper, several selection strategies are proposed and evaluated with respect to the detection delay experienced by the checker.  ...  The other dependencies need an extra computation time to be rebuilt (detection delay). This delay is influenced by the adopted selection strategy.  ...  ., is injective and ¼ ¾ ´ µ · ´ ¼ µ¸ ¼ (1) being · a partial order, that is the transitive closure of the relation on the set ´ µ. The Checker Process.  ... 
doi:10.1109/empdp.2003.1183592 dblp:conf/pdp/BaldoniM03 fatcat:nwvwzs3a35gency46hbrashr7y

Consensus genetic maps: a graph theoretic approach

B.N. Jackson, S. Aluru, P.S. Schnable
2005 2005 IEEE Computational Systems Bioinformatics Conference (CSB'05)  
We create an aggregate by merginging the transitive closure of the input graphs and taking the transitive reduction of the result.  ...  In our method, each input map is treated as a partial order on a set of markers. To find the most consistent order shared between maps, we model the partial orders as directed graphs.  ...  Thus they do not explicitly treat the maps as partial orders, use the transitive reduction/closure operations as we describe, and use a different method of graph merging.  ... 
doi:10.1109/csb.2005.26 dblp:conf/csb/JacksonAS05 fatcat:penhialxrbep3nh7a4z7mdlzby

Canonizable Partial Order Generators and Regular Slice Languages [article]

Mateus de Oliveira Oliveira
2012 arXiv   pre-print
., slice graphs that generate only transitive reduced DAGs, and showed that they could be used to solve several problems related to the partial order behavior of p/t-nets.  ...  By using our transitive reduction algorithm, we prove that the class of partial order languages representable by saturated slice graphs is closed under union, intersection and even under a suitable notion  ...  From a conceptual perspective our transitive reduction algorithm conciliates the flexibility of reasoning about partial orders in terms of DAGs, which is implicit in most of the literature dedicated to  ... 
arXiv:1009.5341v4 fatcat:mk6yuwlkurd57hlrppw3qpbve4
« Previous Showing results 1 — 15 out of 19,948 results