Sciweavers

20126 search results - page 144 / 4026
» Timed Transition Systems
Sort
View
ECAI
2008
Springer
15 years 8 months ago
Incremental Diagnosis of DES by Satisfiability
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
Alban Grastien, Anbulagan
FOSSACS
2012
Springer
14 years 2 months ago
Synthesizing Probabilistic Composers
Synthesis from components is the automated construction of a composite system from a library of reusable components such that the system satisfies the given specification. This i...
Sumit Nain, Moshe Y. Vardi
MOBIHOC
2009
ACM
16 years 7 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu
DEDS
2002
106views more  DEDS 2002»
15 years 6 months ago
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
Peter Buchholz, Peter Kemper
CONCUR
2005
Springer
16 years 23 hour ago
The Individual and Collective Token Interpretations of Petri Nets
Starting from the opinion that the standard firing rule of Petri nets embodies the collective token interpretation of nets rather than their individual token interpretation, I pro...
Rob J. van Glabbeek