Sciweavers

1679 search results - page 37 / 336
» Strong order equivalence
Sort
View
ATAL
2011
Springer
12 years 10 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...
TCS
2008
13 years 9 months ago
Petri nets are less expressive than state-extended PA
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Key word...
Mojmír Kretínský, Vojtech Reh...
MFCS
2001
Springer
14 years 2 months ago
Automata on Linear Orderings
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...
Véronique Bruyère, Olivier Carton
ICDT
2011
ACM
270views Database» more  ICDT 2011»
13 years 1 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis
FMCAD
2009
Springer
14 years 4 months ago
Scalable conditional equivalence checking: An automated invariant-generation based approach
—Sequential equivalence checking (SEC) technologies, capable of demonstrating the behavioral equivalence of two designs, have grown dramatically in capacity over the past decades...
Jason Baumgartner, Hari Mony, Michael L. Case, Jun...