Sciweavers

55 search results - page 6 / 11
» Coalgebraic Foundations of Linear Systems
Sort
View
85
Voted
WG
2007
Springer
15 years 3 months ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
95
Voted
FTRTFT
1998
Springer
15 years 1 months ago
Fair Synchronous Transition Systems and Their Liveness Proofs
We present a compositional semantics of synchronous systems that captures both safety and progress properties of such systems. The fair synchronous transitions systems (fsts) mode...
Amir Pnueli, Natarajan Shankar, Eli Singerman
77
Voted
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 9 months ago
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
Paul Christiano, Jonathan A. Kelner, Aleksander Ma...
103
Voted
PLDI
2006
ACM
15 years 3 months ago
Specifying distributed trust management in LolliMon
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
Jeff Polakow, Christian Skalka
97
Voted
DEDS
1998
152views more  DEDS 1998»
14 years 9 months ago
Timed Petri Nets in Hybrid Systems: Stability and Supervisory Control
In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in de...
Xenofon D. Koutsoukos, Kevin X. He, Michael D. Lem...