Sciweavers

656 search results - page 121 / 132
» A Formalization of Transition P Systems
Sort
View
ASE
2005
137views more  ASE 2005»
14 years 9 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
ATAL
2009
Springer
15 years 27 days ago
Choice, interoperability, and conformance in interaction protocols and service choreographies
Many real-world applications of multiagent systems require independently designed (heterogeneous) and operated (autonomous) agents to interoperate. We consider agents who offer bu...
Matteo Baldoni, Cristina Baroglio, Amit K. Chopra,...
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
15 years 9 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
CONCUR
2009
Springer
15 years 4 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
108
Voted
BMCBI
2004
177views more  BMCBI 2004»
14 years 9 months ago
Gapped alignment of protein sequence motifs through Monte Carlo optimization of a hidden Markov model
Background: Certain protein families are highly conserved across distantly related organisms and belong to large and functionally diverse superfamilies. The patterns of conservati...
Andrew F. Neuwald, Jun S. Liu